The augmented Lagrangian method can approximately solve convex optimization with least constraint violation

DOI10.1007/s10107-022-01843-2zbMath1528.90256arXiv2111.06194OpenAlexW3214514323MaRDI QIDQ6102759

Yu-Hong Dai, Li-wei Zhang

Publication date: 23 June 2023

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

Full work available at URL: https://arxiv.org/abs/2111.06194

zbMATH Keywords

convex optimizationaugmented Lagrangian methodsolution mappingoptimal value mappingdual functionshifted problemconjugate dualleast constraint violation

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (1)

Study on convex optimization with least constraint violation under a general measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Hard-constrained inconsistent signal feasibility problems
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Optimization and nonsmooth analysis
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Convex Analysis
• Mathematical Programs with Equilibrium Constraints

This page was built for publication: The augmented Lagrangian method can approximately solve convex optimization with least constraint violation