The gradient projection algorithm for smooth sets and functions in nonconvex case
type: Item
instance of: scholarly article
title: The gradient projection algorithm for smooth sets and functions in nonconvex case
zbMATH Open document ID: 1473.90124
published in: Set-Valued and Variational Analysis
publication date: 2021-08-12T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 46N10
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 7381146
zbMATH Keywords: Lipschitz continuous gradient
zbMATH Keywords: proximal smoothness
zbMATH Keywords: gradient projection algorithm
zbMATH Keywords: metric projection
zbMATH Keywords: nonconvex extremal problem
zbMATH Keywords: Lezanski-Polyak-Lojasiewicz condition
author: Maxim V. Balashov
MaRDI profile type: Publication
full work available at URL: s11228-020-00550-4
OpenAlex ID: W3046279486
cites work: Convex programming in Hilbert space
cites work: Q5576518
cites work: Q3797760
cites work: Über das Minimumproblem für Funktionale in Banachschen Räumen
cites work: Q5593503
cites work: Q5643297
cites work: Sur le problème de la division
cites work: New error bounds and their applications to convergence analysis of iterative algorithms
cites work: About the Lipschitz property of the metric projection in the Hilbert space
cites work: Maximization of a function with Lipschitz continuous gradient
cites work: Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
cites work: The Geometry of Algorithms with Orthogonality Constraints
cites work: The Gradient Projection Method Along Geodesics
cites work: Minimizing a quadratic over a sphere
cites work: Q5433140
cites work: Q4241150
cites work: Q4310716
cites work: Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
cites work: Gradient descent with non-convex constraints: local concavity determines convergence
cites work: Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
cites work: Projection-like retractions on matrix manifolds
cites work: Q5293249
cites work: Strong and Weak Convexity of Sets and Functions
cites work: Q4856862
cites work: The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
cites work: Weakly convex and proximally smooth sets in Banach spaces
cites work: Strong and Weak Convexity of Closed Sets in a Hilbert Space
cites work: On various notions of regularity of sets in nonsmooth analysis
cites work: Local differentiability of distance functions
cites work: Q5269141
cites work: Convergence to equilibrium for discretizations of gradient-like flows on Riemannian manifolds
DOI: 10.1007/S11228-020-00550-4
Recommended article: Q5269141
Recommended article: The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient
Recommended article: On the gradient projection method for weakly convex functions on a proximally smooth set
Recommended article: Q4979615
Recommended article: Q3780771
Recommended article: Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
Recommended article: Q4388747
Recommended article: Q3735480
Recommended article: Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
Recommended article: Q5153443
description: scientific article; zbMATH DE number 7381146