Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
From MaRDI portal
Publication:3454970
DOI10.1007/978-1-4614-3924-0_1zbMath1346.90686OpenAlexW2100634383MaRDI QIDQ3454970
Jong-Shi Pang, Bin Yu, John E. Mitchell
Publication date: 3 December 2015
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-3924-0_1
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (9)
Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ On convex quadratic programs with linear complementarity constraints ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ A branch-and-bound algorithm for instrumental variable quantile regression ⋮ Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints ⋮ Branch-and-cut for complementarity-constrained optimization ⋮ A study of the difference-of-convex approach for solving linear programs with complementarity constraints ⋮ Solving linear programs with complementarity constraints using branch-and-cut
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An LPCC approach to nonconvex quadratic programs
- On linear programs with linear complementarity constraints
- Three modeling paradigms in mathematical programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Lift-and-project for mixed 0-1 programming: recent progress
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Disjunctive programming: Properties of the convex hull of feasible points
- A likelihood-MPEC approach to target classification
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Numerical evaluation of SBmethod
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- BARON: A general purpose global optimization software package
- A branch-and-cut method for 0-1 mixed convex programming
- Disjunctive cuts for continuous linear bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- Gomory cuts revisited
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- A unifying framework for several cutting plane methods for semidefinite programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Jointly Constrained Biconvex Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- CSDP, A C library for semidefinite programming
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Facets of the Complementarity Knapsack Polytope
This page was built for publication: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
