Complexity and performance of an Augmented Lagrangian algorithm
Ernesto G. Birgin (egbirginime.usp.br)
Abstract: Algencan is a well established safeguarded Augmented Lagrangian algorithm introduced in [R. Andreani, E. G. Birgin, J. M. Martínez 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.
Keywords: Nonlinear programming, Augmented Lagrangian methods, complexity, numerical experiments.
Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )
Entry Submitted: 07/01/2019
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|