TY - JOUR
T1 - On the best achievable quality of limit points of augmented Lagrangian schemes
AU - Andreani, Roberto
AU - Haeser, Gabriel
AU - Mito, Leonardo M.
AU - Ramos, Alberto
AU - Secchin, Leonardo D.
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/6
Y1 - 2022/6
N2 - The optimization literature is vast in papers dealing with improvements on the global convergence of augmented Lagrangian schemes. Usually, the results are based on weak constraint qualifications, or, more recently, on sequential optimality conditions obtained via penalization techniques. In this paper, we propose a somewhat different approach, in the sense that the algorithm itself is used in order to formulate a new optimality condition satisfied by its feasible limit points. With this tool at hand, we present several new properties and insights on limit points of augmented Lagrangian schemes, in particular, characterizing the strongest possible global convergence result for the safeguarded augmented Lagrangian method.
AB - The optimization literature is vast in papers dealing with improvements on the global convergence of augmented Lagrangian schemes. Usually, the results are based on weak constraint qualifications, or, more recently, on sequential optimality conditions obtained via penalization techniques. In this paper, we propose a somewhat different approach, in the sense that the algorithm itself is used in order to formulate a new optimality condition satisfied by its feasible limit points. With this tool at hand, we present several new properties and insights on limit points of augmented Lagrangian schemes, in particular, characterizing the strongest possible global convergence result for the safeguarded augmented Lagrangian method.
KW - Augmented Lagrangian methods
KW - Nonlinear optimization
KW - Optimality conditions
UR - https://www.scopus.com/pages/publications/85118301632
U2 - 10.1007/s11075-021-01212-8
DO - 10.1007/s11075-021-01212-8
M3 - Article
AN - SCOPUS:85118301632
SN - 1017-1398
VL - 90
SP - 851
EP - 877
JO - Numerical Algorithms
JF - Numerical Algorithms
IS - 2
ER -