Convexification techniques for linear complementarity constraints

DOI10.1007/S10898-020-00979-9zbMATH Open1473.90163OpenAlexW3124745458MaRDI QIDQ2045009FDOQ2045009

Jean-Philippe 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

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

zbMATH Keywords

cutting planescomplementarity constraintsconvex hullsreformulation-linearization-techniquelift-and-projectfractional factors

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite dimensional analysis. A hitchhiker's guide.
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• 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
• 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
• A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
• Nonlinear Programming
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Disjunctive programming: Properties of the convex hull of feasible points
• A polyhedral study of nonconvex quadratic programs with box 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
• Convex analysis and global optimization
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• An LPCC approach to nonconvex quadratic programs
• On linear programs with linear complementarity constraints
• Interior-point algorithms, penalty methods and equilibrium problems
• Facets of the Complementarity Knapsack Polytope
• 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
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• On the matrix-cut rank of polyhedra.
• Convexification Techniques for Linear Complementarity Constraints
• Cutting-Planes for Complementarity Constraints
• Technical Note—The Use of Cuts in Complementary Programming
• A robust SQP method for mathematical programs with linear complementarity constraints
• On cutting planes for cardinality-constrained linear programs
• Application of disjunctive programming to the linear complementarity problem
• Enhanced intersection cutting-plane approach for linear complementarity problems
• Some fundamental properties of successive convex relaxation methods on LCP and related problems
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction

Cited In (6)

• Techniques of linear programming based on the theory of convex cones
• On solving difference of convex functions programs with linear complementarity constraints
• Relaxations and cutting planes for linear programs with complementarity constraints
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
• Linearly constrained positive definite completions
• Convex integration with linear constraints and its applications

Uses Software

• KNITRO
• PATH Solver
• MacMPEC
• MILES

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)