Accelerated differential inclusion for convex optimization
arXiv:2103.06629
Abstract
This paper introduces a second-order differential inclusion for unconstrained convex optimization. In continuous level, solution existence in proper sense is obtained and exponential decay of a novel Lyapunov function along with the solution trajectory is derived as well. Then in discrete level, based on numerical discretizations of the continuous model, two inexact proximal point algorithms are proposed, and some new convergence rates are established via a discrete Lyapunov function.
References in corpus (9)
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- A Variational Perspective on Accelerated Methods in Optimization
- Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
- A Lyapunov Analysis of Momentum Methods in Optimization
- From differential equation solvers to accelerated first-order methods for convex optimization
- Accelerated First-Order Methods: Differential Equations and Lyapunov Functions
- First order optimization methods based on Hessian-driven Nesterov accelerated gradient flow
- Nesterov's method with decreasing learning rate leads to accelerated stochastic gradient descent
- Nesterov's acceleration and Polyak's heavy ball method in continuous time: convergence rate analysis under geometric conditions and perturbations