Pages that link to "Item:Q5470211"

The following pages link to A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints (Q5470211):

Displaying 23 items.

• Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
• A line search exact penalty method using steering rules (Q431002) (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
• An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
• Lifting mathematical programs with complementarity constraints (Q662308) (← links)
• Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints (Q742306) (← links)
• A globally convergent algorithm for MPCC (Q748600) (← links)
• Bi-level programming model of container port game in the container transport supernetwork (Q1034945) (← links)
• Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (Q1639718) (← links)
• Bilevel programming and applications (Q1665319) (← links)
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations (Q1941032) (← links)
• Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• On approximate stationary points of the regularized mathematical program with complementarity constraints (Q2194126) (← links)
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications (Q2382702) (← links)
• A smoothing-regularization approach to mathematical programs with vanishing constraints (Q2393647) (← links)
• Structural properties of affine sparsity constraints (Q2425165) (← links)
• Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
• Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited (Q5252220) (← links)
• Direct pseudo-spectral method for optimal control of obstacle problem - an optimal control problem governed by elliptic variational inequality (Q5348436) (← links)
• MPCC strategies for nonsmooth nonlinear programs (Q6050379) (← links)