The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion
From MaRDI portal
Publication:5149515
DOI10.1142/S0217595920400011zbMath1459.90223arXiv1910.06937OpenAlexW3028403277MaRDI QIDQ5149515
Publication date: 11 February 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.06937
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical relative error criterion for augmented Lagrangians
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
- 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
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Multiplier and gradient methods
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- On Penalty and Multiplier Methods for Constrained Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
- Convex Analysis
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods
