The Lezanski-Polyak-Lojasiewicz inequality and the convergence of the gradient projection algorithm
From MaRDI portal
Publication:6488011
DOI10.18500/1816-9791-2023-23-1-4-10MaRDI QIDQ6488011
Publication date: 22 March 2023
Published in: Izvestiya Saratovskogo Universiteta. Novaya Seriya. Seriya Matematika, Mekhanika, Informatika (Search for Journal in Brave)
gradient projection algorithmreal-analytic functionproximal smoothnesserror bound conditionLezanski-Polyak-Lojasiewicz inequality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- The gradient projection method with Armijo's step size on manifolds
- Stability of minimization problems and the error bound condition
- Convergence to equilibrium for discretizations of gradient-like flows on Riemannian manifolds
- Preservation of Prox-Regularity of Sets with Applications to Constrained Optimization
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- Strong and Weak Convexity of Sets and Functions
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
- Sur le problème de la division
This page was built for publication: The Lezanski-Polyak-Lojasiewicz inequality and the convergence of the gradient projection algorithm