A study of the difference-of-convex approach for solving linear programs with complementarity constraints
From MaRDI portal
Publication:1749452
DOI10.1007/S10107-017-1208-6zbMath1397.90264OpenAlexW2607956614MaRDI QIDQ1749452
Francisco Jara-Moroni, Jong-Shi Pang, Andreas Wächter
Publication date: 16 May 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1208-6
Nonlinear programming (90C30) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (12)
Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ Strategic investment decisions in an oligopoly with a competitive fringe: an equilibrium problem with equilibrium constraints approach ⋮ Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints ⋮ On solving difference of convex functions programs with linear complementarity constraints ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ On the pervasiveness of difference-convexity in optimization and statistics ⋮ DC programming and DCA: thirty years of developments ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- On solving linear complementarity problems by DC programming and DCA
- An LPCC approach to nonconvex quadratic programs
- A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints
- On linear programs with linear complementarity constraints
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Algorithms for linear programming with linear complementarity constraints
- On convex quadratic programs with linear complementarity constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A pivoting algorithm for linear programming with linear complementarity constraints
- Computing B-Stationary Points of Nonsmooth DC Programs
- DC Programming and DCA for General DC Programs
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Cutting-Planes for Complementarity Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- On the Global Convergence of a Filter--SQP Algorithm
- Technical Note—The Use of Cuts in Complementary Programming
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Technical Note—Complementary Programming
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Mathematical Programs with Equilibrium Constraints
- Nonlinear programming without a penalty function.
This page was built for publication: A study of the difference-of-convex approach for solving linear programs with complementarity constraints
