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

DOI10.1007/S11228-020-00550-4MaRDI QIDQ2045187zbMATH OpenOpenAlexFDO

Authors 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 algorithmLezanski-Polyak-Lojasiewicz conditionLipschitz continuous gradientmetric projectionnonconvex extremal problemproximal smoothness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6731404
• The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
• On the gradient projection method for weakly convex functions on a proximally smooth set
• scientific article; zbMATH DE number 6307098
• scientific article; zbMATH DE number 4043629
• Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
• scientific article; zbMATH DE number 1150496
• scientific article; zbMATH DE number 3968343
• Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
• scientific article; zbMATH DE number 7404502

Cites work

• About the Lipschitz property of the metric projection in the Hilbert space
• Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
• Convergence to equilibrium for discretizations of gradient-like flows on Riemannian manifolds
• Convex programming in Hilbert space
• Error bounds, quadratic growth, and linear convergence of proximal methods
• Gradient descent with non-convex constraints: local concavity determines convergence
• Gradient projection and conditional gradient methods for constrained nonconvex minimization
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 1282147 (Why is no real title available?)
• scientific article; zbMATH DE number 681023 (Why is no real title available?)
• scientific article; zbMATH DE number 823375 (Why is no real title available?)
• scientific article; zbMATH DE number 6731404 (Why is no real title available?)
• scientific article; zbMATH DE number 5168474 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• scientific article; zbMATH DE number 3293978 (Why is no real title available?)
• scientific article; zbMATH DE number 3313108 (Why is no real title available?)
• scientific article; zbMATH DE number 3371284 (Why is no real title available?)
• Local differentiability of distance functions
• Maximization of a function with Lipschitz continuous gradient
• Minimizing a quadratic over a sphere
• New error bounds and their applications to convergence analysis of iterative algorithms
• On various notions of regularity of sets in nonsmooth analysis
• Projection-like retractions on matrix manifolds
• Strong and Weak Convexity of Closed Sets in a Hilbert Space
• Strong and Weak Convexity of Sets and Functions
• Sur le problème de la division
• The Geometry of Algorithms with Orthogonality Constraints
• The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
• The Gradient Projection Method Along Geodesics
• Weakly convex and proximally smooth sets in Banach spaces
• Über das Minimumproblem für Funktionale in Banachschen Räumen

Cited in

(20)

• The gradient projection method with Armijo's step size on manifolds
• Stability of minimization problems and the error bound condition
• Gradient projection method on matrix manifolds
• On the gradient projection method for weakly convex functions on a proximally smooth set
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
• Proximal gradient methods for general smooth graph total variation model in unsupervised learning
• Maximization of a function with Lipschitz continuous gradient
• Two algorithms for finding the projection of a point onto a nonconvex set in a normed space
• The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
• scientific article; zbMATH DE number 6307098 (Why is no real title available?)
• Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
• Gradient projection and conditional gradient methods for constrained nonconvex minimization
• scientific article; zbMATH DE number 6731404 (Why is no real title available?)
• Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
• Conditions for linear convergence of the gradient method for non-convex optimization
• The Lezanski-Polyak-Lojasiewicz inequality and the convergence of the gradient projection algorithm
• The gradient projection method for a supporting function on the unit sphere and its applications
• Lipschitz continuity of the metric projection operator and convergence of gradient methods
• The Polyak-Lojasiewicz condition for a strongly convex function on a smooth manifold and its application
• Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045187)