On approximate stationary points of the regularized mathematical program with complementarity constraints
DOI10.1007/s10957-020-01706-wzbMath1450.90049OpenAlexW3040442494MaRDI QIDQ2194126
Tangi Migot, Abdeslam Kadrani, Jean-Pierre Dussault, Mounir Haddou
Publication date: 25 August 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01706-w
nonlinear programmingconstraint qualificationregularization methodsMPCCoptimization model with complementarity constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Solving mathematical programs with equilibrium constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A globally convergent algorithm for MPCC
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- A Generalized Mathematical Program with Equilibrium Constraints
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
- New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- On sequential optimality conditions for smooth constrained optimization
This page was built for publication: On approximate stationary points of the regularized mathematical program with complementarity constraints