Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
From MaRDI portal
Publication:304240
DOI10.1007/s10107-015-0921-2zbMath1358.90082OpenAlexW872784446MaRDI QIDQ304240
Sourour Elloumi, Amélie Lambert, Alain Billionnet
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0921-2
branch-and-bound algorithmsemidefinite programmingequivalent convex reformulationinteger quadratic programming
Related Items (14)
A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ Structured linear reformulation of binary quadratically constrained quadratic programs ⋮ Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems ⋮ Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Extending the QCR method to general mixed-integer programs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Global optimization. From theory to implementation.
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Introduction to Semidefinite, Conic and Polynomial Optimization
- Linear Reformulations of Integer Quadratic Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- CSDP, A C library for semidefinite programming
- Essays and Surveys in Global Optimization
- Deterministic global optimization in nonlinear optimal control problems
This page was built for publication: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
