mlsanityData to 7 Oct 2026

Complexity and performance of an Augmented Lagrangian algorithm

arXiv 1907.02401 ↗First posted 4 Jul 2019math.OCcited by 6

Not on the map. Why?

Abstract (arXiv)

Algencan is a well established safeguarded Augmented Lagrangian algorithm introduced in [R. Andreani, E. G. Birgin, J. M. Mart'inez and M. L. Schuverdt, On Augmented Lagrangian methods with general lower-level constraints, SIAM Journal on Optimization 18, pp. 1286-1309, 2008]. Complexity results that report its worst-case behavior in terms of iterations and evaluations of functions and derivatives that are necessary to obtain suitable stopping criteria are presented in this work. In addition, the computational performance of a new version of the method is presented, which shows that the updated software is a useful tool for solving large-scale constrained optimization problems.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 0; 2025: 3.

6 papers.