Solving mathematical programs with complementarity constraints as nonlinear programs
From MaRDI portal
Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) 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)
Recommendations
- scientific article; zbMATH DE number 5070336
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- Combining the regularization strategy and the SQP to solve MPCC -- a MATLAB implementation
- A penalty method and a regularization strategy to solve MPCC
Cites work
- A comparison of large scale mixed complementarity problem solvers
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A smoothing method for mathematical programs with equilibrium constraints
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Convex two-level optimization
- CUTE
- Engineering and Economic Applications of Complementarity Problems
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- Nonlinear programming without a penalty function.
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- The penalty interior-point method fails to converge
Cited in
(78)- Solving bilevel linear programs using multiple objective linear programming
- Bi-level programming model of container port game in the container transport supernetwork
- Computational approaches for mixed integer optimal control problems with indicator constraints
- Solving normalized stationary points of a class of equilibrium problem with equilibrium constraints
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Algorithms for linear programming with linear complementarity 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
- Convexification techniques for linear 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
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- 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
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Bilevel optimization with a multiobjective problem in the lower level
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- A general MPCC model and its solution algorithm for continuous network design problem
- Bilevel optimization applied to strategic pricing in competitive electricity markets
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- An SOS1-based approach for solving MPECs with a natural gas market application
- Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- A note on stability of stationary points in mathematical programs with generalized complementarity constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- An interior-point algorithm for solving inverse linear optimization problem
- The quasiparticle lifetime in a doped graphene sheet
- Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
- Feasibility problems with complementarity constraints
- Complementarity constraints as nonlinear equations: Theory and numerical experience
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- An interior point technique for solving bilevel programming problems
- scientific article; zbMATH DE number 123958 (Why is no real title available?)
- Solving nonlinear programming problems with very many constraints
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- scientific article; zbMATH DE number 1487995 (Why is no real title available?)
- On the global minimization of the value-at-risk
- Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- An alternative nonparametric tail risk measure
- MPEC methods for bilevel optimization problems
- Sequential linearization method for bound-constrained mathematical programs with complementarity constraints
- A new MIP approach on the least distance problem in DEA
- 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
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- Model order reduction techniques with a posteriori error control for nonlinear robust optimization governed by partial differential equations
- A penalty method and a regularization strategy to solve MPCC
- scientific article; zbMATH DE number 5070336 (Why is no real title available?)
- Active set algorithm for mathematical programs with linear complementarity constraints
- The penalty interior-point method fails to converge
- A survey of nonlinear robust optimization
- Modeling design and control problems involving neural network surrogates
- MPCC strategies for nonsmooth nonlinear programs
- Three modeling paradigms in mathematical programming
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
- Newton-type methods for constrained optimization with nonregular constraints
- MPCC: strong stability of weakly nondegenerate S-stationary points
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
- Optimal repurchasing contract design for efficient utilization of computing resources
- A neural network-based approach to hybrid systems identification for control
- Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control
- Triggering a variety of Nash-equilibria in oligopolistic electricity markets
- Optimization problems with equilibrium constraints and their numerical solution.
- Combining the regularization strategy and the SQP to solve MPCC -- a MATLAB implementation
- Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- A unified funnel restoration SQP algorithm
- On stability of M-stationary points in mpccs
- 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
- An enhanced logical benders approach for linear programs with complementarity constraints
- Effective reformulations of the truss topology design problem
- Interior-point algorithms, penalty methods and equilibrium problems
- Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets
This page was built for publication: Solving mathematical programs with complementarity constraints as nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673321)
