Geodesic
How the Augmented Lagrangian Algorithm Can Deal with an Infeasible Convex Quadratic Optimization Problem
Journal of convex analysis, Tome 23 (2016) no. 2, pp. 425-459
Cet article a éte moissonné depuis la source Heldermann Verlag

Voir la notice de l'article

This paper analyses the behavior of the augmented Lagrangian algorithm when it deals with an infeasible convex quadratic optimization problem. It is shown that the algorithm finds a point that, on the one hand, satisfies the constraints shifted by the smallest possible shift that makes them feasible and, on the other hand, minimizes the objective on the corresponding shifted constrained set. The speed of convergence to such a point is globally linear, with a rate that is inversely proportional to the augmentation parameter. This suggests us a rule for determining the augmentation parameter that aims at controlling the speed of convergence of the shifted constraint norm to zero; this rule has the advantage of generating bounded augmentation parameters even when the problem is infeasible.
Classification : 49M27, 49M29, 65K05, 90C05, 90C06, 90C20, 90C25
Mots-clés : Augmented Lagrangian algorithm, augmentation parameter update, closest feasible problem, convex quadratic optimization, feasible shift, global linear convergence, infeasible problem, proximal point algorithm, quasi-global error bound, shifted constraint 
@article{JCA_2016_23_2_JCA_2016_23_2_a4,
     author = {A. Chiche and J. C. Gilbert},
     title = {How the {Augmented} {Lagrangian} {Algorithm} {Can} {Deal} with an {Infeasible} {Convex} {Quadratic} {Optimization} {Problem}},
     journal = {Journal of convex analysis},
     pages = {425--459},
     year = {2016},
     volume = {23},
     number = {2},
     url = {http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a4/}
}
TY  - JOUR
AU  - A. Chiche
AU  - J. C. Gilbert
TI  - How the Augmented Lagrangian Algorithm Can Deal with an Infeasible Convex Quadratic Optimization Problem
JO  - Journal of convex analysis
PY  - 2016
SP  - 425
EP  - 459
VL  - 23
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a4/
ID  - JCA_2016_23_2_JCA_2016_23_2_a4
ER  - 
%0 Journal Article
%A A. Chiche
%A J. C. Gilbert
%T How the Augmented Lagrangian Algorithm Can Deal with an Infeasible Convex Quadratic Optimization Problem
%J Journal of convex analysis
%D 2016
%P 425-459
%V 23
%N 2
%U http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a4/
%F JCA_2016_23_2_JCA_2016_23_2_a4
A. Chiche; J. C. Gilbert. How the Augmented Lagrangian Algorithm Can Deal with an Infeasible Convex Quadratic Optimization Problem. Journal of convex analysis, Tome 23 (2016) no. 2, pp. 425-459. http://geodesic.mathdoc.fr/item/JCA_2016_23_2_JCA_2016_23_2_a4/