The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints

References

• Allgower E. L., Georg K.Numerical Continuation Methods (1990) (Springer, Berlin) Crossref, Google Scholar
• Anitescu M. On using the elastic mode in nonlinear programming approaches to mathematical programs with complementarity constraints. SIAM J. Optim. (2005) 15:1203–1236Crossref, Google Scholar
• Anitescu M., Tseng P., Wright S. J. Elastic-mode algorithms for mathematical programs with equilibrium constraints: Global convergence and stationarity properties. Math. Programming (2007) 110:337–371Crossref, Google Scholar
• Benson H. Y., Sen A., Shanno D. F., Vanderbei R. J. Interior point algorithms, penalty methods and equilibrium problems. Comput. Optim. Appl. (2006) 34:155–182Crossref, Google Scholar
• Bouza Allende G. Mathematical programs with equilibrium constraints: Solution techniques from parametric optimization. (2006) . Ph.D. thesis, University of Twente, Enschede, The NetherlandsGoogle Scholar
• Červinka M. On computation of C-stationary points for equilibrium problems with linear complementarity constraints via homotopy method. Kybernetika (2010) 46:730–753Google Scholar
• Cottle R. W., Dantzig G. B., Dantzig G. B., Eaves B. C. Complementary pivot theory of mathematical programming. Studies in Optimization (1974) 10(MAA Studies in Mathematics)27–51Google Scholar
• de Miguel A., Friedlander M., Nogales F., Scholtes S. An interior-point method for MPECs. SIAM J. Optim. (2005) 16:587–609Crossref, Google Scholar
• Eaves B. C., Cottle R. W., Lemke C. E. A short course in solving equations with PL homotopies. SIAM-AMS Proc. Nonlinear Programming (1976) 9(American Mathematical Society, Providence, RI) 73–143Google Scholar
• Facchinei F., Jiang H., Qi L. A smoothing method for mathematical programs with equilibrium constraints. Math. Programming (1999) 85:81–106Crossref, Google Scholar
• Fletcher R., Leyffer S., Ralph D., Scholtes S. Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. (2006) 17:259–286Crossref, Google Scholar
• Fukushima M., Pang J., Théra M., Tichatschke R. Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. Ill-Posed Variational Problems and Regularization Techniques (1999) 447(Springer, Berlin) 99–110Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
• Fukushima M., Tseng P. An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints. SIAM J. Optim. (2002) 12:724–739Crossref, Google Scholar
• Giallombardo G., Ralph D. Multiplier convergence in trust region methods with application to convergence of decomposition methods for MPECs. Math. Programming (2008) 112:335–369Crossref, Google Scholar
• Guddat J., Guerra Vázquez F., Jongen H. Th.Parametric Optimization: Singularities, Pathfollowing and Jumps (1990) (Wiley, Chichester) Crossref, Google Scholar
• Hu X., Ralph D. Convergence of a penalty method for mathematical programming with complementarity constraints. J. Optim. Theory Appl. (2004) 123:365–390Crossref, Google Scholar
• Huang X. X., Yang X. Q., Zhu D. L. A sequential smooth penalization approach to mathematical programs with complementarity constraints. Numer. Functional Anal. Optim. (2006) 27:71–98Crossref, Google Scholar
• Ioffe A., Schwartzman E. Metric critical point theory 1. Morse regularity and homotopic stability of a minimum. J. de Mathématiques Pures et Appliquées (1996) 75:125–153Google Scholar
• Jiang H., Ralph D. QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Comput. Optim. Appl. (1999) 13:25–59Crossref, Google Scholar
• Jiang H., Ralph D. Extension of quasi-Newton methods to mathematical programs with complementarity constraints. Comput. Optim. Appl. (2002) 25:123–150Crossref, Google Scholar
• Jongen H. Th., Jonker P., Twilt F. Critical sets in parametric optimization. Math. Programming (1986) 34:333–353Crossref, Google Scholar
• Jongen H. Th., Jonker P., Twilt F.Nonlinear Optimization in Finite Dimensions (2000) (Kluwer, Dordrecht, The Netherlands) Google Scholar
• Jongen H. Th., Meer K., Triesch E.Optimization Theory (2004) (Kluwer, Boston) Google Scholar
• Jongen H. Th., Rückmann J.-J., Shikhman V. MPCC: Critical point theory. SIAM J. Optim. (2009) 20:473–484Crossref, Google Scholar
• Jongen H. Th., Shikhman V., Steffensen S. Characterization of strong stability for C-stationary points in MPCC. Math. Programming (2010) . ForthcomingGoogle Scholar
• Jongen H. Th., Möbert T., Rückmann J.-J., Tammer K. On inertia and Schur complement in optimization. Linear Algebra and Its Appl. (1987) 95:97–109Crossref, Google Scholar
• Lin G., Fukushima M. Hybrid approach with active set identification for mathematical programs with complementarity constraints. J. Optim. Theory Appl. (2006) 128:1–28Crossref, Google Scholar
• Liu X., Perakis G., Sun J. A robust SQP method for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. (2006) 34:5–33Crossref, Google Scholar
• Luo Z. Q., Pang J. S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge) Crossref, Google Scholar
• Luo Z. Q., Pang J. S., Ralph D., Migdalas A., Pardalos P., Värbrand P. Piecewise sequential quadratic programming for mathematical programs with nonlinear complementarity constraints. Multilevel Optimization: Algorithms, Complexity and Applications (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 209–229Crossref, Google Scholar
• Ouellette D. V. Schur complements and statistics. Linear Algebra and Its Appl. (1981) 36:187–295Crossref, Google Scholar
• Raghunathan A. U., Biegler L. T. Interior point methods for mathematical programs with complementarity constraints. SIAM J. Optim. (2005) 15:720–750Crossref, Google Scholar
• Ralph D., Stein O. Homotopy methods for quadratic programs with complementarity constraints. (2006) . Technical Report 120, Department of Mathematics—C, RWTH Aachen University, Aachen, GermanyGoogle Scholar
• Ralph D., Wright S. J. Some properties of regularization and penalization schemes for MPECs. Optim. Methods and Software (2004) 19:527–556Crossref, Google Scholar
• Scheel H., Scholtes S. Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity. Math. Oper. Res. (2000) 25:1–22Link, Google Scholar
• Scholtes S. Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. (2001) 11:918–936Crossref, Google Scholar
• Scholtes S., Stöhr M. Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control Optim. (1999) 37:617–652Crossref, Google Scholar
• Scholtes S., Stöhr M. How stringent is the linear independence assumption for mathematical programs with complementarity constraints? Math. Oper. Res. (2001) 21:851–863Link, Google Scholar
• Stein O. Lifting mathematical programs with complementarity constraints. Math. Programming (2010) . ForthcomingGoogle Scholar
• Stein O.On Parametric Semi-Infinite Optimization (1997) (Shaker, Aachen, Germany) Google Scholar
• Stein O.Bi-Level Strategies in Semi-Infinite Programming (2003) (Kluwer, Boston) Crossref, Google Scholar
• Stöhr M.Nonsmooth Trust Region Methods and Their Applications to Mathematical Programs with Equilibrium Constraints (1999) (Shaker, Aachen, Germany) Google Scholar
• Zhang J., Liu G. A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints. J. Global Optim. (2001) 19:335–361Crossref, Google Scholar