New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints

References

• Flegel ML, Kanzow C. A Fritz John approach to first order optimality conditions for mathematical programs with equilibrium constraints. Optimization. 2003;52:277–286.
   Web of Science ®Google Scholar
• Fukushima M, Pang JS. Complementarity constraint qualifications and simplified B-stationary conditions for mathematical programs with equilibrium constraints. Comput Optim Appl. 1999;13:111–136.
   Web of Science ®Google Scholar
• Kanzow C, Schwartz A. Mathematical programs with equilibrium constraints: enhanced Fritz John conditions, new constraint qualifications and improved exact penalty results. SIAM J Optim. 2010;20:2730–2753.
   Web of Science ®Google Scholar
• Outrata JV. Optimality conditions for a class of mathematical programs with equilibrium constraints. Math Oper Res. 1999;24:627–644.
   Web of Science ®Google Scholar
• Outrata JV. A generalized mathematical program with equilibrium constraints. SIAM J Control Optim. 2000;38:1623–1638.
   Web of Science ®Google Scholar
• Scheel H, Scholtes S. Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math Oper Res. 2000;25:1–22.
   Web of Science ®Google Scholar
• Ye JJ. Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J Optim. 2000;10:943–962.
   Web of Science ®Google Scholar
• Ye JJ. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J Math Anal Appl. 2005;307:350–369.
   Web of Science ®Google Scholar
• Ye JJ, Ye XY. Necessary optimality conditions for optimization problems with variational inequality constraints. Math Oper Res. 1997;22:977–997.
   Web of Science ®Google Scholar
• Hoheisel T. Mathematical programs with vanishing constraints [PhD thesis], Julius-Maximilians-Universität Würzburg; 2009.
   Google Scholar
• Rockafellar RT, Wets RJ-B. Variational analysis. Berlin: Springer; 1998.
   Google Scholar
• Flegel ML, Kanzow C, Outrata JV. Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints. Set-Valued Anal. 2007;15:139–162.
   Google Scholar
• Kanzow C, Schwartz A. The price of inexactness: convergence properties of relaxation methods for mathematical programs with equilibrium constraints revisited. Math Oper Res. 2015;40:253–275.
   Web of Science ®Google Scholar
• Benko M, Gfrerer H. On estimating the regular normal cone to constraint systems and stationary conditions. Optimization. 2017;66:61–92.
   Web of Science ®Google Scholar
• Jeroslow R. Representability in mixed integer programming, I: characterization results. Discrete Appl Math. 1977;17:223–243.
   Web of Science ®Google Scholar
• Balas E. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J Algebraic Discrete Meth. 1985;6:466–486.
   Web of Science ®Google Scholar
• Ceria S, Soares J. Convex programming for disjunctive convex optimization. Math Program Ser A. 1999;86:595–614.
   Web of Science ®Google Scholar
• Gfrerer H, Outrata JV. On computation of generalized derivatives of the normal-cone mapping and their applications. Math Oper Res. 2016;41:1535–1556.
   Web of Science ®Google Scholar
• Henrion R, Outrata JV. Calmness of constraint systems with applications. Math Program Ser B. 2005;104:437–464.
   Web of Science ®Google Scholar
• Gfrerer H, Klatte D. Lipschitz and Hölder stability of optimization problems and generalized equations. Math Program Ser A. 2016;158:35–75.
   Web of Science ®Google Scholar
• Gfrerer H. First order and second order characterizations of metric subregularity and calmness of constraint set mappings. SIAM J Optim. 2011;21:1439–1474.
   Web of Science ®Google Scholar
• Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
   Google Scholar
• Robinson SM. Some continuity properties of polyhedral multifunctions. Math Program Stud. 1981;14:206–214.
   Web of Science ®Google Scholar
• Gfrerer H, Ye JJ. New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis. SIAM J Optim. 2017;27:842–865.
   Web of Science ®Google Scholar
• Benko M, Gfrerer H. An SQP method for mathematical programs with vanishing constraints with strong convergence properties. Comput Optim Appl. 2017;67:361–399.
   PubMed Web of Science ®Google Scholar
• Fletcher R. Practical methods of optimization. Vol. 2, Constrained optimization. Chichester: Wiley; 1981.
   Google Scholar