English
Related papers

Related papers: Open Problem: Two Riddles in Heavy-Ball Dynamics

200 papers

We analyze fast diagonal methods for simple bilevel programs. Guided by the analysis of the corresponding continuous-time dynamics, we provide a unified convergence analysis under general geometric conditions, including H\"olderian growth…

Optimization and Control · Mathematics 2025-05-21 Radu Ioan Boţ , Enis Chenchene , Ernö Robert Csetnek , David Alexander Hulett

This paper presents an algorithm for computing inner estimates of the regions of attraction of limit cycles of a nonlinear hybrid system. The basic procedure is: (1) compute the dynamics of the system transverse to the limit cycle; (2) from…

Optimization and Control · Mathematics 2010-10-13 Ian R. Manchester

In this paper, we investigate the growth error bound condition. By using the proximal point algorithm, we first provide a more accessible and elementary proof of the fact that Kurdyka-{\L}ojasiewicz conditions imply growth error bound…

Optimization and Control · Mathematics 2024-06-12 Qinian Jin

Gradient-based optimization algorithms can be studied from the perspective of limiting ordinary differential equations (ODEs). Motivated by the fact that existing ODEs do not distinguish between two fundamentally different…

Optimization and Control · Mathematics 2018-11-05 Bin Shi , Simon S. Du , Michael I. Jordan , Weijie J. Su

After briefly reviewing the hamiltonian approach to 2+1 dimensional gravity in absence of matter on closed universes, we consider 2+1 dimensional gravity coupled to point particles in an open universe. We show that the hamiltonian structure…

High Energy Physics - Theory · Physics 2007-05-23 L. Cantini , P. Menotti , D. Seminara

We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…

Combinatorics · Mathematics 2024-09-25 Volker Kaibel , Kirill Kukharenko

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…

Data Structures and Algorithms · Computer Science 2018-06-22 Markus Chimani , Tilo Wiedera

We present an exact solution of the equations for orbit determination of a two body system in a hyperbolic or parabolic motion. In solving this problem, we extend the method employed by Asada, Akasaka and Kasai (AAK) for a binary system in…

Astrophysics · Physics 2009-11-11 Hideki Asada

The problem of two interacting particles moving in a d-dimensional billiard is considered here. A suitable coordinate transformation leads to the problem of a particle in an unconventional hyperbilliard. A dynamical map can be readily…

Condensed Matter · Physics 2009-10-30 Lilia Meza-Montes , Sergio E. Ulloa

Some of the guiding problems in partially hyperbolic systems are the following: (1) Examples, (2) Properties of invariant foliations, (3) Accessibility, (4) Ergodicity, (5) Lyapunov exponents, (6) Integrability of central foliations, (7)…

Dynamical Systems · Mathematics 2007-05-23 F. Rodriguez Hertz , M. A. Rodriguez Hertz , R. Ures

We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We…

Combinatorics · Mathematics 2013-12-04 Vladimir G. Deineko , Bettina Klinz , Gerhard J. Woeginger

Arguably, the two most popular accelerated or momentum-based optimization methods in machine learning are Nesterov's accelerated gradient and Polyaks's heavy ball, both corresponding to different discretizations of a particular second order…

Optimization and Control · Mathematics 2020-12-25 Guilherme França , Jeremias Sulam , Daniel P. Robinson , René Vidal

We present a methodology for establishing the existence of quadratic Lyapunov inequalities for a wide range of first-order methods used to solve convex optimization problems. In particular, we consider i) classes of optimization problems of…

Optimization and Control · Mathematics 2025-10-24 Manu Upadhyaya , Sebastian Banert , Adrien B. Taylor , Pontus Giselsson

Equidistribution of the orbits of points, subvarieties or of periodic points in complex dynamics is a fundamental problem. It is often related to strong ergodic properties of the dynamical system and to a deep understanding of analytic…

Complex Variables · Mathematics 2016-11-29 Tien-Cuong Dinh , Nessim Sibony

We construct symplectic blenders for two classical Hamiltonian systems: the 3-body problem and its restricted version. We use these objects to show that both models exhibit a robust, strong form of topological instability. We do not assume…

Dynamical Systems · Mathematics 2026-03-25 Marcel Guardia , Jaime Paradela

In this article a family of second order ODEs associated to inertial gradient descend is studied. These ODEs are widely used to build trajectories converging to a minimizer $x^*$ of a function $F$, possibly convex. This family includes the…

Optimization and Control · Mathematics 2019-07-08 Othmane Sebbouh , Charles Dossal , Aude Rondepierre

In the first part of this dissertation research, we develop a modular framework that can serve as a recipe for constructing and analyzing iterative algorithms for convex optimization. Specifically, our work casts optimization as iteratively…

Optimization and Control · Mathematics 2021-06-25 Jun-Kun Wang

Evolutionary motions in a bouncing ball system consisting of a ball having a free fall in the Earth's gravitational field have been studied systematically. Because of nonlinear form of the equations of motion, evolutions show chaos for…

Dynamical Systems · Mathematics 2016-01-08 L. M. Saha , Til Prasad Sarma , Purnima Dixit

Much recent interest has focused on "open" dynamical systems, in which a classical map or flow is considered only until the trajectory reaches a "hole", at which the dynamics is no longer considered. Here we consider questions pertaining to…

Chaotic Dynamics · Physics 2016-11-23 Carl P. Dettmann

The heavy-ball momentum method accelerates gradient descent with a momentum term but lacks accelerated convergence for general smooth strongly convex problems. This work introduces the Accelerated Over-Relaxation Heavy-Ball (AOR-HB) method,…

Optimization and Control · Mathematics 2025-02-18 Jingrong Wei , Long Chen