Hoheisel, Tim; Kanzow, Christian First- and second-order optimality conditions for mathematical programs with vanishing constraints. (English) Zbl 1164.90407 Appl. Math., Praha 52, No. 6, 495-514 (2007). Summary: We consider a special class of optimization problems that we call Mathematical Programs with Vanishing Constraints, MPVC for short, which serves as a unified framework for several applications in structural and topology optimization. Since an MPVC most often violates stronger standard constraint qualification, first-order necessary optimality conditions, weaker than the standard KKT-conditions, were recently investigated in depth. This paper enlarges the set of optimality criteria by stating first-order sufficient and second-order necessary and sufficient optimality conditions for MPVCs. Cited in 22 Documents MSC: 90C30 Nonlinear programming 90C33 Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) Keywords:mathematical programs with vanishing constraints; mathematical programs with equilibrium constraints; first-order optimality conditions; second-order optimality conditions PDF BibTeX XML Cite \textit{T. Hoheisel} and \textit{C. Kanzow}, Appl. Math., Praha 52, No. 6, 495--514 (2007; Zbl 1164.90407) Full Text: DOI EuDML References: [1] W. Achtziger, C. Kanzow: Mathematical programs with vanishing constraints: Optimality conditions and constraint qualifications. Math. Program. To appear. · Zbl 1151.90046 [2] M. S. Bazaraa, H. D. Sherali, and C. M. Shetty: Nonlinear Programming. Theory and Algorithms. 2nd edition. John Wiley & Sons, Hoboken, 1993. [3] M. L. Flegel, C. Kanzow: A direct proof for M-stationarity under MPEC-ACQ for mathematical programs with equilibrium constraints. In: Optimization with Multivalued Mappings: Theory, Applications and Algorithms (S. Dempe, V. Kalashnikov, eds.). Springer-Verlag, New York, 2006, pp. 111–122. · Zbl 1125.90062 [4] C. Geiger, C. Kanzow: Theorie und Numerik restringierter Optimierungsaufgaben. Springer-Verlag, Berlin, 2002. (In German.) · Zbl 1003.90044 [5] T. Hoheisel, C. Kanzow: On the Abadie and Guignard constraint qualification for mathematical programs with vanishing constraints. Optimization. To appear. · Zbl 1162.90560 [6] T. Hoheisel, C. Kanzow: Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J. Math. Anal. Appl. 337 (2008), 292–310. · Zbl 1141.90572 · doi:10.1016/j.jmaa.2007.03.087 [7] Z.-Q. Luo, J.-S. Pang, and D. Ralph: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, 1997. · Zbl 0898.90006 [8] O. L. Mangasarian: Nonlinear Programming. McGraw-Hill Book Company, New York, 1969. [9] J. V. Outrata: Optimality conditions for a class of mathematical programs with equilibrium constraints. Math. Oper. Res. 24 (1999), 627–644. · Zbl 1039.90088 · doi:10.1287/moor.24.3.627 [10] J. V. Outrata, M. Kočvara, and J. Zowe: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Nonconvex Optimization and its Applications. Kluwer, Dordrecht, 1998. · Zbl 0947.90093 [11] H. Scheel, S. Scholtes: Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity. Math. Oper. Res. 25 (2000), 1–22. · Zbl 1073.90557 · doi:10.1287/moor.25.1.1.15213 [12] S. Scholtes: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11 (2001), 918–936. · Zbl 1010.90086 · doi:10.1137/S1052623499361233 [13] S. Scholtes: Nonconvex structures in nonlinear programming. Oper. Res. 52 (2004), 368–383. · Zbl 1165.90597 · doi:10.1287/opre.1030.0102 [14] J. J. Ye: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. 307 (2005), 350–369. · Zbl 1112.90062 · doi:10.1016/j.jmaa.2004.10.032 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.