A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
From MaRDI portal
Recommendations
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- On the solution of mathematical programming problems with equilibrium constraints
- Semidefinite relaxation for linear programs with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Relaxation approach for equilibrium problems with equilibrium constraints
- Some results on mathematical programs with equilibrium constraints
- scientific article; zbMATH DE number 1086742
- On a relaxation method for mathematical programs with vanishing constraints
- scientific article; zbMATH DE number 6612219
- Solving mathematical programs with equilibrium constraints
Cited in
(32)- Bi-level programming model of container port game in the container transport supernetwork
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Bilevel programming and applications
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Convexification techniques for linear complementarity constraints
- On approximate stationary points of the regularized mathematical program with complementarity constraints
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Structural properties of affine sparsity constraints
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- Active-set prediction for interior point methods using controlled perturbations
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
- Global solution of bilevel programming problems
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties
- scientific article; zbMATH DE number 4016054 (Why is no real title available?)
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- Relaxation approach for equilibrium problems with equilibrium constraints
- A line search exact penalty method using steering rules
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- A short state of the art on multi-leader-follower games
- MPEC methods for bilevel optimization problems
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Direct pseudo-spectral method for optimal control of obstacle problem-an optimal control problem governed by elliptic variational inequality
- A survey of nonlinear robust optimization
- MPCC strategies for nonsmooth nonlinear programs
- Lifting mathematical programs with complementarity constraints
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
- A globally convergent algorithm for MPCC
This page was built for publication: A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470211)
