Obtaining tighter relaxations of mathematical programs with complementarity constraints
From MaRDI portal
Recommendations
- New relaxation method for mathematical programs with complementarity constraints
- A relaxation method for mathematical programs with vertical complementarity constraints
- Convexification techniques for linear complementarity constraints
- Convexification techniques for linear complementarity constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- A likelihood-MPEC approach to target classification
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A unifying framework for several cutting plane methods for semidefinite programming
- An LPCC approach to nonconvex quadratic programs
- BARON: A general purpose global optimization software package
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- CSDP, A C library for semidefinite programming
- Disjunctive cuts for continuous linear bilevel programming
- Disjunctive Programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Facets of the Complementarity Knapsack Polytope
- Gomory cuts revisited
- scientific article; zbMATH DE number 1187158 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Jointly Constrained Biconvex Programming
- Lift-and-project for mixed 0-1 programming: recent progress
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Linear programming relaxations of quadratically constrained quadratic programs
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- New branch-and-Cut algorithm for bilevel linear programming
- Numerical evaluation of SBmethod
- On linear programs with linear complementarity constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Three modeling paradigms in mathematical programming
Cited in
(21)- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- A branch-and-bound algorithm for instrumental variable quantile regression
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Global optimization method for solving mathematical programs with linear complementarity constraints
- Convexification techniques for linear complementarity constraints
- On linear problems with complementarity constraints
- Solving linear programs with complementarity constraints using branch-and-cut
- On convex quadratic programs with linear complementarity constraints
- Conic approximation to quadratic optimization with linear complementarity constraints
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- A globally convergent probability-one homotopy for linear programs with linear complementarity constraints
- Convexification techniques for linear complementarity constraints
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Branch-and-cut for complementarity-constrained optimization
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Modified relaxation method for mathematical programs with complementarity constraints
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- Cardinality minimization, constraints, and regularization: a survey
- Relaxations and cutting planes for linear programs with complementarity constraints
- An enhanced logical benders approach for linear programs with complementarity constraints
This page was built for publication: Obtaining tighter relaxations of mathematical programs with complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454970)
