The new butterfly relaxation method for mathematical programs with complementarity constraints
We propose a new family of relaxation schemes for mathematical programs with
complementarity constraints. We discuss the properties of the sequence of relaxed non …
complementarity constraints. We discuss the properties of the sequence of relaxed non …
Solving mathematical programs with complementarity constraints with a penalization approach
In this paper, we consider mathematical problems with complementarity constraints. To
solve it, we propose a penalization approach based on concave and nondecreasing …
solve it, we propose a penalization approach based on concave and nondecreasing …
Revisiting Path-Following to Solve the Generalized Nash Equilibrium Problem
T Migot, MG Cojocaru - International Conference on Applied Mathematics …, 2019 - Springer
In this short paper, we present a generic path-following approach to tackle the generalized
Nash equilibrium problem (GNEP) via its KKT conditions. This general formulation can be …
Nash equilibrium problem (GNEP) via its KKT conditions. This general formulation can be …