The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient

DOI10.1070/SM9214zbMath1447.90036OpenAlexW2995035084MaRDI QIDQ3304387

Maxim V. Balashov

Publication date: 31 July 2020

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm9214

zbMATH Keywords

gradient projection algorithmgradient mappingproximal smoothnesserror bound conditionnonconvex extremal problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (5)

Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds ⋮ Stability of minimization problems and the error bound condition ⋮ On the gradient projection method for weakly convex functions on a proximally smooth set ⋮ Growth conditions on a function and the error bound condition ⋮ The gradient projection algorithm for smooth sets and functions in nonconvex case

Cites Work

• 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
• Introductory lectures on convex optimization. A basic course.
• New error bounds and their applications to convergence analysis of iterative algorithms
• From error bounds to the complexity of first-order descent methods for convex functions
• METRIC REGULARITY—A SURVEY PART 1. THEORY
• METRIC REGULARITY—A SURVEY PART II. APPLICATIONS
• Strong and Weak Convexity of Sets and Functions
• Local differentiability of distance functions
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
• Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
• Weakly convex and proximally smooth sets in Banach spaces
• Convex programming in Hilbert space
• On various notions of regularity of sets in nonsmooth analysis

This page was built for publication: The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient