Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients
From MaRDI portal
Publication:6071885
DOI10.1137/23m1545720arXiv2307.03331OpenAlexW4388414083MaRDI QIDQ6071885
Lexiao Lai, Cédric Josz, XiaoPeng Li
Publication date: 29 November 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2307.03331
Nonconvex programming, global optimization (90C26) Nonlinear ordinary differential equations and systems (34A34) Semialgebraic sets and related spaces (14P10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Lectures on convex optimization
- Nonconvergence to unstable points in urn models and stochastic approximations
- Submersions and preimages of sets of measure zero
- On gradients of functions definable in o-minimal structures
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- First-order methods almost always avoid strict saddle points
- Behavior of accelerated gradient methods near critical points of nonconvex functions
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Variational Analysis in Sobolev and BV Spaces
- Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
- Genericity in Polynomial Optimization
- Clarke Subgradients of Stratifiable Functions
- Decoding by Linear Programming
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Some methods of speeding up the convergence of iteration methods
- Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke
- Heavy-ball method in nonconvex optimization problems
- Correction to: ``Global convergence of the gradient method for functions definable in o-minimal structures
- Certifying the Absence of Spurious Local Minima at Infinity
This page was built for publication: Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients
