Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
DOI10.1007/S10957-014-0546-2zbMATH Open1315.90054OpenAlexW2164997203MaRDI QIDQ481045FDOQ481045
Authors: Nguyen Huy Chieu, Gue Myung Lee
Publication date: 12 December 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0546-2
Recommendations
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications
- A new constraint qualification for mathematical programs with equilibrium constraints
- Review on constraint qualifications and optimality conditions for mathematical programs with equilibrium constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
constraint qualificationsmathematical programs with equilibrium constraintsinductionpreservationisolatedness of local minimizers
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Cites Work
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A relaxed constant positive linear dependence constraint qualification and applications
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Equilibrium Constraints
- Three modeling paradigms in mathematical programming
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- Characterization of strong stability for C-stationary points in MPCC
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Stability analysis for parametric mathematical programs with geometric constraints and its applications
- Title not available (Why is that?)
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- On M-stationary points for mathematical programs with equilibrium constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- MPCC: critical point theory
- Mathematical programs with complementarity constraints in traffic and telecommunications networks
Cited In (13)
- Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences
- A sharp Lagrange multiplier theorem for nonlinear programs
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
- Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators
- MPEC methods for bilevel optimization problems
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints
Uses Software
This page was built for publication: Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q481045)