Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants
DOI10.1007/s10957-021-01914-yzbMath1492.90172OpenAlexW3188405987MaRDI QIDQ2139269
Alexey F. Izmailov, Mikhail V. Solodov
Publication date: 17 May 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01914-y
smoothinglinear convergencesuperlinear convergencesemistabilitysecond-order sufficient optimality conditionsaugmented Lagrangianstrong metric regularityupper Lipschitz stabilityproximal method of multipliers
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- Multiplier methods: A survey
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- A class of smoothing functions for nonlinear and mixed complementarity problems
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems
- Newton-type methods: a broader view
- Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
- Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
- Multiplier and gradient methods
- The multiplier method of Hestenes and Powell applied to convex programming
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- Lagrange Multipliers and Optimality
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical Optimization
- Trust Region Methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces
- Newton-Type Methods for Optimization and Variational Problems
- Abstract Newtonian Frameworks and Their Applications
- Implicit Functions and Solution Mappings
- Practical Augmented Lagrangian Methods for Constrained Optimization
- The rate of convergence of proximal method of multipliers for nonlinear programming