On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions

被引:29
作者
Izmailov, A. F. [2 ]
Solodov, M. V. [1 ]
机构
[1] IMPA, BR-22460320 Rio De Janeiro, Brazil
[2] Moscow MV Lomonosov State Univ, Fac Computat Mat & Cybernet, Dept Operat Res, Moscow 119992, Russia
关键词
degenerate constraints; second-order sufficient condition; Newton method; SQP; perlinear convergence; MATHEMATICAL PROGRAMS; COMPLEMENTARITY CONSTRAINTS; OPTIMALITY CONDITIONS; EQUILIBRIUM CONSTRAINTS; GENERALIZED EQUATIONS; NONLINEAR PROGRAMS; LOCAL CONVERGENCE; SQP; 2-REGULARITY; ALGORITHM;
D O I
10.1007/s10107-007-0158-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Assuming that the primal part of the sequence generated by a Newton-type (e.g., SQP) method applied to an equality-constrained problem converges to a solution where the constraints are degenerate, we investigate whether the dual part of the sequence is attracted by those Lagrange multipliers which satisfy second-order sufficient condition (SOSC) for optimality, or by those multipliers which violate it. This question is relevant at least for two reasons: one is speed of convergence of standard methods; the other is applicability of some recently proposed approaches for handling degenerate constraints. We show that for the class of damped Newton methods, convergence of the dual sequence to multipliers satisfying SOSC is unlikely to occur. We support our findings by numerical experiments. We also suggest a simple auxiliary procedure for computing multiplier estimates, which does not have this undesirable property. Finally, some consequences for the case of mixed equality and inequality constraints are discussed.
引用
收藏
页码:271 / 304
页数:34
相关论文
共 32 条
[21]  
Leyffer S., MACMPEC AMPL COLLECT
[22]  
Li D.H., 2000, AMR005 U NEW S WAL
[23]  
Maratos N.G., 1978, Ph.D. Thesis
[24]  
Robinson SM, 2003, NONCON OPTIM ITS APP, V68, P401
[25]   STRONGLY REGULAR GENERALIZED EQUATIONS [J].
ROBINSON, SM .
MATHEMATICS OF OPERATIONS RESEARCH, 1980, 5 (01) :43-62
[26]   Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity [J].
Scheel, H ;
Scholtes, S .
MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) :1-22
[27]   Exact penalization of mathematical programs with equilibrium constraints [J].
Scholtes, S ;
Stöhr, M .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1999, 37 (02) :617-652
[28]   How stringent is the linear independence assumption for mathematical programs with complementarity constraints? [J].
Scholtes, S ;
Stöhr, M .
MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (04) :851-863
[29]   Superlinear convergence of a stabilized SQP method to a degenerate solution [J].
Wright, SJ .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 11 (03) :253-275
[30]   An algorithm for degenerate nonlinear programming with rapid local convergence [J].
Wright, SJ .
SIAM JOURNAL ON OPTIMIZATION, 2005, 15 (03) :673-696