An extension of the second order dynamical system that models Nesterov's convex gradient method
Not on the map. Why?
Abstract (arXiv)
In this paper we deal with a general second order continuous dynamical system associated to a convex minimization problem with a Fr`echet differentiable objective function. We show that inertial algorithms, such as Nesterov's algorithm, can be obtained via the natural explicit discretization from our dynamical system. Our dynamical system can be viewed as a perturbed version of the heavy ball method with vanishing damping, however the perturbation is made in the argument of the gradient of the objective function. This perturbation seems to have a smoothing effect for the energy error and eliminates the oscillations obtained for this error in the case of the heavy ball method with vanishing damping, as some numerical experiments show. We prove that the value of the objective function in a generated trajectory converges in order O(1/t2) to the global minimum of the objective function. Moreover, we obtain that a trajectory generated by the dynamical system converges to a minimum point of the objective function.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1.
5 papers.
- 2022Gradient Norm Minimization of Nesterov Acceleration: o(1/k3)cited by 8
- 2021Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimizationcited by 6
- 2021Inertial Newton Algorithms Avoiding Strict Saddle Pointscited by 2
- 2023Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimizationcited by 1
- 2021A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimizationcited by 0
- 2023Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization16 Nov 2023
- 2022Gradient Norm Minimization of Nesterov Acceleration: o(1/k3)19 Sep 2022
- 2021Inertial Newton Algorithms Avoiding Strict Saddle Points8 Nov 2021
- 2021A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization16 Oct 2021
- 2021Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization23 Feb 2021