Convexification techniques for linear complementarity constraints
From MaRDI portal
Publication:2045009
DOI10.1007/s10898-020-00979-9zbMath1473.90163OpenAlexW3124745458MaRDI QIDQ2045009
Jean-Philippe P. Richard, Trang T. Nguyen, Mohit Tawarmalani
Publication date: 11 August 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00979-9
cutting planesconvex hullscomplementarity constraintsreformulation-linearization-techniquelift-and-projectfractional factors
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An LPCC approach to nonconvex quadratic programs
- On linear programs with linear complementarity constraints
- Interior-point algorithms, penalty methods and equilibrium problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- A polyhedral study of nonconvex quadratic programs with box constraints
- Some fundamental properties of successive convex relaxation methods on LCP and related problems
- On cutting planes for cardinality-constrained linear programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A robust SQP method for mathematical programs with linear complementarity constraints
- Enhanced intersection cutting-plane approach for linear complementarity problems
- On the Matrix-Cut Rank of Polyhedra
- Convexification Techniques for Linear Complementarity Constraints
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cutting-Planes for Complementarity Constraints
- Engineering and Economic Applications of Complementarity Problems
- 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
- Application of disjunctive programming to the linear complementarity problem
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Nonlinear Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Facets of the Complementarity Knapsack Polytope
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Convex analysis and global optimization
