Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints

We consider global convergence properties of the augmented Lagrangian methods on problems with degenerate constraints, with a special emphasis on mathematical programs with complementarity constraints (MPCC). In the general case, we show convergence to stationary points of the problem under an error...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on optimization Vol. 22; no. 4; pp. 1579 - 1606
Main Authors: Izmailov, A. F., Solodov, M. V., Uskov, E. I.
Format: Journal Article
Language:English
Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Subjects:
Applied mathematics
Approximation
Collection
Constraints
Convergence
Mathematical models
Mathematical programming
Methods
Nonlinear equations
Optimization
Quadratic programming
Robustness
Solvers
ISSN:1052-6234, 1095-7189
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider global convergence properties of the augmented Lagrangian methods on problems with degenerate constraints, with a special emphasis on mathematical programs with complementarity constraints (MPCC). In the general case, we show convergence to stationary points of the problem under an error bound condition for the feasible set (which is weaker than constraint qualifications), assuming that the iterates have some modest features of approximate local minimizers of the augmented Lagrangian. For MPCC, we first argue that even weak forms of general constraint qualifications that are suitable for convergence of the augmented Lagrangian methods, such as the recently proposed relaxed positive linear dependence condition, should not be expected to hold and thus special analysis is needed. We next obtain a rather complete picture, showing that, under this context's usual MPCC-linear independence constraint qualification, feasible accumulation points of the iterates are guaranteed to be C-stationary for MPCC (better than weakly stationary), but in general need not be M-stationary (hence, neither strongly stationary). However, strong stationarity is guaranteed if the generated dual sequence is bounded, which we show to be the typical numerical behavior even though the multiplier set itself is unbounded. Experiments with the ALGENCAN augmented Lagrangian solver on the MacMPEC and DEGEN collections are reported, with comparisons to the SNOPT and filterSQP implementations of the SQP method, to the MINOS implementation of the linearly constrained Lagrangian method, and to the interior-point solvers IPOPT and KNITRO. We show that ALGENCAN is a very good option if one is primarily interested in robustness and quality of computed solutions. [PUBLICATION ABSTRACT]
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1052-6234
1095-7189
DOI:10.1137/120868359