mlsanityData to 7 Oct 2026

Fast optimization via inertial dynamics with closed-loop damping

arXiv 2008.02261 ↗First posted 5 Aug 2020math.OC math.DScited by 4

Not on the map. Why?

Abstract (arXiv)

In a Hilbert space H, in order to develop fast optimization methods, we analyze the asymptotic behavior, as time t tends to infinity, of inertial continuous dynamics where the damping acts as a closed-loop control. The function f: H → R to be minimized (not necessarily convex) enters the dynamic through it gradient, which is assumed to be Lipschitz continuous on the bounded subsets of H. This gives autonomous dynamical systems with nonlinear damping and nonlinear driving force. We first consider the case where the damping term partial φ (dotx(t)) acts as a closed-loop control of the velocity. The damping potential φ : H → [0,+∞) is a convex continuous function which achieves its minimum at the origin. We show the existence and uniqueness of a global solution to the associated Cauchy problem. Then, we analyze the asymptotic convergence properties of the generated trajectories generated. We use techniques from optimization, control theory, and PDE's: Lyapunov analysis based on the decreasing property of an energy-like function, quasi-gradient and Kurdyka-Lojasiewicz theory, monotone operator theory for wave-like equations. Convergence rates are obtained based on the geometric properties of the data f and φ. When f is strongly convex, we give general conditions which provide exponential convergence rates. Then, we extend the results to the case where an additional Hessian-driven damping enters the dynamic, which reduces the oscillations. Finally, we consider an inertial system involving jointly the velocity dotx(t) and the gradient nabla f(x(t)). In addition to its original results, this work surveys the numerous works devoted in recent years to the interaction between continuous damped inertial dynamics and numerical algorithms for optimization, with the emphasis on autonomous systems, closed-loop adaptive procedures, and convergence rates.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 1; 2023: 1.

4 papers.