A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints

REFERENCES

• J. P. Aubin and H. Frankowska ( 1990 ). Set-Valued Analysis . Birkhauser , Boston .
   Google Scholar
• A. Ben-Tal and J. Zowe ( 1982 ). A unified theory of first-order and second-order conditions for extremum problems in topological vector spaces . Math. Prog. Study 19 : 39 – 76 .
   Web of Science ®Google Scholar
• A. Ben-Tal and J. Zowe ( 1982 ). Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems . Math. Prog. 24 : 70 – 91 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• G. B. Dantzig , J. Folkman and N. Shapiro ( 1967 ). On the continuity of the minimum set of a continuous function . J. Math. Anal. Appl. 17 : 519 – 548 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• F. Facchinei , H. Jiang and L. Qi ( 1999 ). A smoothing method for mathematical programs with equilibrium constraints . Math. Prog. 85 : 107 – 134 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• M. Fukushima Z. Q. Luo and J. S. Pang ( 1998 ). A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints . Computat. Optimiz. Appl. 10 : 5 – 30 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• A. V. Fiacco and G. P. McCormick ( 1990 ). Nonlinear Programming, Sequential Unconstrained Minimization Techniques . SIAM , Philadelphia .
   Google Scholar
• M. Fukushima and J. S. Pang ( 1999 ). Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. Ill-posed variational problems and regularization techniques (Trier, 1998) . Lecture Notes in Economics and Mathematical Systems , Vol. 477 , Springer , Berlin , pp. 99 – 110 .
   Google Scholar
• F. Facchinei and J. Soares ( 1997 ). A new merit function for nonlinear complementarity problems and a related algorithm . SIAM J. Optimiz. 7 : 225 – 247 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• M. Fukushima and P. Tseng ( 2001 ). An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints . SIAM J. Optimiz. 12 : 724 – 739 [CSA]
   Web of Science ®Google Scholar
• E. G. Golshtein and N. V. Tretyakov ( 1996 ). Modified Lagrangians and Monotone Maps in Optimization . John Wiley & Sons , New York .
   Google Scholar
• X. M. Hu and D. Ralph ( 2004 ). Convergence of a penalty method for mathematical programming with complementarity constraints . J. Optim. Theory Appl. 123 ( 2 ): 365 – 390 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• H. Jiang and D. Ralph ( 1999 ). QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints . Computat. Optimiz. Appl. 13 : 25 – 59 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• Z. Q. Luo J. S. Pang and D. Ralph ( 1996 ). Mathematical Programs with Equilibrium Constraints . Cambridge University Press , Cambridge .
   Google Scholar
• J. V. Outrata ( 1994 ). On optimization problems with variational inequality constraints . SIAM J. Optimiz. 4 : 340 – 357 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• J. V. Outrata and J. Zowe ( 1995 ). A numerical approach to optimization problems with variational inequality constraints . Math. Prog. 68 : 105 – 130 [CSA]
   Web of Science ®Google Scholar
• J. S. Pang and M. Fukushima (1999). Complementarity constraint qualifications and simplified B-stationary conditions for mathematical programs with complementarity constraints. Computat. Optimiz. Appl. 13:111–136 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• S. Scholtes ( 2001 ). Convergence properties of a regularization scheme for mathematical programs with complementarity constraints . SIAM J. Optimiz. 11 : 918 – 936 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• S. Scholtes and M. Stohr ( 1999 ). Exact penalization of mathematical programs with equilibrium constraints . SIAM J. Control Optimiz. 37 : 617 – 652 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• H. Scheel and S. Scholtes ( 2000 ). Mathematical programs with complementarity constraints: stationarity, optimality and sensitivity . Math. Operations Res. 25 : 1 – 22 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• S. Scholtes and M. Stohr ( 2001 ). How stringent is the linear independence assumption for mathematical programs with complementarity constraints . Math. Operations Res. 26 : 851 – 863 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• H. Schramm and J. Zowe ( 1992 ). A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results . SIAM J. Optimiz. 2 : 121 – 152 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• X. Q. Yang ( 1996 ). On second-order directional derivatives . Nonlinear Analy. Theory Methods Appl. 26 : 55 – 66 [CROSSREF] [CSA]
   Web of Science ®Google Scholar
• X. Q. Yang ( 1994 ). An exterior point method for computing points that satisfy second-order necessary conditions for a C 1,1 optimization problem . J. Math. Anal. Appl. 187 : 118 – 133 [CROSSREF] [CSA]
   Web of Science ®Google Scholar