Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.
['Roberto Andreani', 'Ernesto G. Birgin', 'José Mario Martínez', 'María Laura Schuverdt']
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification