Solving mathematical programs with complementarity constraints as nonlinear programs

DOI10.1080/10556780410001654241zbMath1074.90044OpenAlexW2034039293MaRDI QIDQ4673321

Sven Leyffer, Roger Fletcher

Publication date: 29 April 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001654241

zbMATH Keywords

MPCC, Complementarity Constraints, Nonlinear Programming, Sequential Quadratic Programming, Interior-point Methods

Mathematics Subject Classification ID

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) Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)

Related Items (60)

An SOS1-based approach for solving MPECs with a natural gas market application ⋮ Sustainability SI: optimal prices of electricity at public charging stations for plug-in electric vehicles ⋮ Smoothing and regularization strategies for optimization of hybrid dynamic systems ⋮ A survey of nonlinear robust optimization ⋮ A pivoting algorithm for linear programming with linear complementarity constraints ⋮ Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints ⋮ Effective reformulations of the truss topology design problem ⋮ Computational approaches for mixed integer optimal control problems with indicator constraints ⋮ An interior-point algorithm for solving inverse linear optimization problem ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Feasibility problems with complementarity constraints ⋮ Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications ⋮ Interior-point algorithms, penalty methods and equilibrium problems ⋮ Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets ⋮ Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ Three modeling paradigms in mathematical programming ⋮ Modeling design and control problems involving neural network surrogates ⋮ An interior point technique for solving bilevel programming problems ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost ⋮ Bilevel optimization with a multiobjective problem in the lower level ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ 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 ⋮ The quasiparticle lifetime in a doped graphene sheet ⋮ Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints ⋮ Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations ⋮ Solving normalized stationary points of a class of equilibrium problem with equilibrium constraints ⋮ Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property ⋮ A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints ⋮ A New MIP Approach on the Least Distance Problem in DEA ⋮ An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities ⋮ Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs ⋮ The penalty interior-point method fails to converge ⋮ A study of the difference-of-convex approach for solving linear programs with complementarity constraints ⋮ A general MPCC model and its solution algorithm for continuous network design problem ⋮ Bilevel optimization applied to strategic pricing in competitive electricity markets ⋮ On the global minimization of the value-at-risk ⋮ Active set algorithm for mathematical programs with linear complementarity constraints ⋮ Optimization problems with equilibrium constraints and their numerical solution. ⋮ Efficiently solving linear bilevel programming problems using off-the-shelf optimization software ⋮ New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences ⋮ Complementarity-based nonlinear programming techniques for optimal mixing in gas networks ⋮ Convexification techniques for linear complementarity constraints ⋮ On stability of M-stationary points in mpccs ⋮ A note on stability of stationary points in mathematical programs with generalized complementarity constraints ⋮ Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities ⋮ Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints ⋮ Solving bilevel linear programs using multiple objective linear programming ⋮ Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty ⋮ Bi-level programming model of container port game in the container transport supernetwork ⋮ An enhanced logical benders approach for linear programs with complementarity constraints ⋮ The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited ⋮ An alternative nonparametric tail risk measure ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ An algorithm for global solution to bi-parametric linear complementarity constrained linear programs ⋮ Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Uses Software

• SNOPT
• AMPL
• MacMPEC
• COPS

Cites Work

• Unnamed Item
• Convex two-level optimization
• A smoothing method for mathematical programs with equilibrium constraints
• A comparison of large scale mixed complementarity problem solvers
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• CUTE
• Engineering and Economic Applications of Complementarity Problems
• Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
• An Interior Point Algorithm for Large-Scale Nonlinear Programming
• Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• The penalty interior-point method fails to converge
• Nonlinear programming without a penalty function.

This page was built for publication: Solving mathematical programs with complementarity constraints as nonlinear programs