On the gradient projection method for weakly convex functions on a proximally smooth set

DOI10.1134/S0001434620110024zbMath1456.90155OpenAlexW3111007828MaRDI QIDQ2217258

Maxim V. Balashov

Publication date: 29 December 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434620110024

zbMATH Keywords

nonsmooth analysisquadratic growthgradient projection methodproximal smoothnessweak convexity

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

Stability of minimization problems and the error bound condition ⋮ Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface ⋮ Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set ⋮ Growth conditions on a function and the error bound condition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introductory lectures on convex optimization. A basic course.
• Subgradient methods for sharp weakly convex functions
• Gradient projection method on matrix manifolds
• 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
• Variational Analysis
• Local differentiability of distance functions
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
• Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
• On various notions of regularity of sets in nonsmooth analysis

This page was built for publication: On the gradient projection method for weakly convex functions on a proximally smooth set