On finite convergence and constraint identification of subgradient projection methods

DOI10.1007/BF01581092zbMath0779.49019OpenAlexW1997191791MaRDI QIDQ1802955

Sjur Didrik Flåm

Publication date: 29 June 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581092

zbMATH Keywords

differential inclusionsstrict complementarityconstraint qualificationcontinuous timefinite convergenceLyapunov's methodsubgradient projection algorithmconstraint identification

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Related Items

Proximal methods avoid active strict saddles of weakly convex functions, Partial Smoothness and Constant Rank, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES, Optimality, identifiability, and sensitivity, Unnamed Item, The chain rule for VU-decompositions of nonsmooth functions, Generic Minimizing Behavior in Semialgebraic Optimization, Active‐Set Newton Methods and Partial Smoothness, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating saddle points as equilibria of differential inclusions
• Stability of continuous subgradient algorithms
• Openness of the metric projection in certain Banach spaces
• Metric Projections and the Gradient Projection Method in Banach Spaces
• Continuous algorithms for solution of convex optimization problems and finding saddle points of contex-coneave functions with the use of projection operations
• The Gradient Projection Method Using Curry’s Steplength
• Projected gradient methods for linearly constrained problems
• On the Identification of Active Constraints
• Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
• On the Goldstein-Levitin-Polyak gradient projection method
• Application of the method of Lyapunov functions to the study of the convergence of numerical methods
• The method of lyapunov functions in the study of continuous algorithms of mathematical programming
• A Continuous Approach to Oligopolistic Market Equilibrium
• Convex programming in Hilbert space
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• A Necessary and Sufficient Qualification for Constrained Optimization
• The Gradient Projection Method under Mild Differentiability Conditions