How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem

Abstract : 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.\addtext{ Implications on an SQP algorithm using the AL algorithm for solving its osculating quadratic problems are discussed
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [58 references]  Display  Hide  Download

https://hal.inria.fr/hal-01057577
Contributor : Jean Charles Gilbert <>
Submitted on : Sunday, August 24, 2014 - 10:30:11 AM
Last modification on : Wednesday, April 17, 2019 - 4:07:57 PM
Document(s) archivé(s) le : Thursday, November 27, 2014 - 1:58:04 PM

File

RR-8583.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01057577, version 1

Collections

Citation

Alice Chiche, Jean Charles Gilbert. How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem. Journal of Convex Analysis, Heldermann, 2016, 23 (2), ⟨http://www.heldermann.de/JCA/JCA23/JCA232/jca23016.htm⟩. ⟨hal-01057577⟩

Share

Metrics

Record views

417

Files downloads

265