Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties

The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the penalty parameter, local solutions satisfying first- and second-order necessary optimality conditions for the original p...

Full description

Saved in:
Bibliographic Details
Published inMathematical programming Vol. 110; no. 2; pp. 337 - 371
Main Authors Anitescu, Mihai, Tseng, Paul, Wright, Stephen J.
Format Journal Article
LanguageEnglish
Published Heidelberg Springer 01.07.2007
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the penalty parameter, local solutions satisfying first- and second-order necessary optimality conditions for the original problem are also first- and second-order points of the elastic-mode formulation. Here we study global convergence properties of methods based on this formulation, which involve generating an (exact or inexact) first- or second-order point of the formulation, for nondecreasing values of the penalty parameter. Under certain regularity conditions on the active constraints, we establish finite or asymptotic convergence to points having a certain stationarity property (such as strong stationarity, M-stationarity, or C-stationarity). Numerical experience with these approaches is discussed. In particular, our analysis and the numerical evidence show that exact complementarity can be achieved finitely even when the elastic-mode formulation is solved inexactly. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
USDOE Office of Science (SC)
National Science Foundation (NSF)
ANL/MCS/JA-53134
DE-AC02-06CH11357
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-006-0005-4