Convexification techniques for linear complementarity constraints
From MaRDI portal
Recommendations
- Convexification techniques for linear complementarity constraints
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- On solving difference of convex functions programs with linear complementarity constraints
- On linear problems with complementarity constraints
- New relaxation method for mathematical programs with complementarity constraints
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A polyhedral study of nonconvex quadratic programs with box constraints
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A robust SQP method for mathematical programs with linear complementarity constraints
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- An LPCC approach to nonconvex quadratic programs
- Application of disjunctive programming to the linear complementarity problem
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex analysis and global optimization
- Convexification techniques for linear complementarity constraints
- Cutting-Planes for Complementarity Constraints
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Engineering and Economic Applications of Complementarity Problems
- Enhanced intersection cutting-plane approach for linear complementarity problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Facets of the Complementarity Knapsack Polytope
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- Infinite dimensional analysis. A hitchhiker's guide.
- Interior-point algorithms, penalty methods and equilibrium problems
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- Nonlinear Programming
- On cutting planes for cardinality-constrained linear programs
- On linear programs with linear complementarity constraints
- On the Global Convergence of a Filter--SQP Algorithm
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On the matrix-cut rank of polyhedra.
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Some fundamental properties of successive convex relaxation methods on LCP and related problems
- Technical Note—The Use of Cuts in Complementary Programming
Cited in
(8)- On solving difference of convex functions programs with linear complementarity constraints
- Linearly constrained positive definite completions
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Techniques of linear programming based on the theory of convex cones
- Convexification techniques for linear complementarity constraints
- Relaxations and cutting planes for linear programs with complementarity constraints
- Convex integration with linear constraints and its applications
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
This page was built for publication: Convexification techniques for linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045009)
