On the convergence of augmented Lagrangian strategies for nonlinear programming
DOI10.1093/IMANUM/DRAB021zbMATH Open1498.65088OpenAlexW3159744173MaRDI QIDQ5075166FDOQ5075166
Ademir Alves Ribeiro, Alberto Ramos, L. D. Secchin, R. Andreani, Ariel R. Velazco
Publication date: 10 May 2022
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/drab021
Recommendations
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- Convergence properties of augmented Lagrangian methods for constrained global optimization
- Improving ultimate convergence of an augmented Lagrangian method
- On the best achievable quality of limit points of augmented Lagrangian schemes
- New convergence properties of the primal augmented Lagrangian method
nonlinear optimizationaugmented Lagrangian methodsoptimality conditionsstopping criteriaapproximate KKT conditions
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10)
Cited In (11)
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- Sequential optimality conditions for optimization problems with additional abstract set constraints
- Improving the global convergence of inexact restoration methods for constrained optimization problems
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- A novel sequential optimality condition for smooth constrained optimization and algorithmic consequences
- Improving ultimate convergence of an augmented Lagrangian method
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- A strong sequential optimality condition for cardinality-constrained optimization problems
- A nonlinear augmented Lagrangian for constrained minimax problems
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
This page was built for publication: On the convergence of augmented Lagrangian strategies for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075166)
