mathematical programs with equilibrium constraints (MPEC);
SQP algorithm;
successive approximation;
global convergence;
superlinear convergence rate;
EQUILIBRIUM CONSTRAINTS;
OPTIMIZATION;
FEASIBILITY;
D O I:
10.1007/s10483-009-0512-x
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this paper, we describe a successive approximation and smooth sequential quadratic programming (SQP) method for mathematical programs with nonlinear complementarity constraints (MPCC). We introduce a class of smooth programs to approximate the MPCC. Using an l (1) penalty function, the line search assures global convergence, while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover, we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints (MPEC) when the algorithm terminates finitely.