The gradient projection algorithm for smooth sets and functions in nonconvex case

DOI10.1007/s11228-020-00550-4zbMath1473.90124OpenAlexW3046279486MaRDI QIDQ2045187

Maxim V. Balashov

Publication date: 12 August 2021

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-020-00550-4

zbMATH Keywords

gradient projection algorithmmetric projectionLipschitz continuous gradientproximal smoothnessLezanski-Polyak-Lojasiewicz conditionnonconvex extremal problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (3)

Stability of minimization problems and the error bound condition ⋮ Proximal gradient methods for general smooth graph total variation model in unsupervised learning ⋮ The gradient projection method with Armijo's step size on manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximization of a function with Lipschitz continuous gradient
• About the Lipschitz property of the metric projection in the Hilbert space
• New error bounds and their applications to convergence analysis of iterative algorithms
• Über das Minimumproblem für Funktionale in Banachschen Räumen
• Convergence to equilibrium for discretizations of gradient-like flows on Riemannian manifolds
• Minimizing a Quadratic Over a Sphere
• Projection-like Retractions on Matrix Manifolds
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• Strong and Weak Convexity of Sets and Functions
• The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
• The Geometry of Algorithms with Orthogonality Constraints
• Local differentiability of distance functions
• Strong and Weak Convexity of Closed Sets in a Hilbert Space
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
• Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
• Gradient descent with non-convex constraints: local concavity determines convergence
• Weakly convex and proximally smooth sets in Banach spaces
• Convex programming in Hilbert space
• The Gradient Projection Method Along Geodesics
• Sur le problème de la division
• On various notions of regularity of sets in nonsmooth analysis

This page was built for publication: The gradient projection algorithm for smooth sets and functions in nonconvex case