Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
From MaRDI portal
Recommendations
- Convex quadratic mixed-integer problems with quadratic constraints
- scientific article; zbMATH DE number 7152114
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems
- A note on convex reformulation schemes for mixed integer quadratic programs
- Extended formulations in mixed integer conic quadratic programming
- scientific article; zbMATH DE number 3920195
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Quadratic convex reformulations for quadratic 0-1 programming
- Compact mixed-integer programming formulations in quadratic optimization
- Quadratic convex reformulations for semicontinuous quadratic programming
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- CSDP, A C library for semidefinite programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Deterministic global optimization in nonlinear optimal control problems
- Essays and Surveys in Global Optimization
- Extending the QCR method to general mixed-integer programs
- Global optimization. From theory to implementation.
- Introduction to semidefinite, conic and polynomial optimization
- Linear Reformulations of Integer Quadratic Programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Cited in
(40)- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- A note on solving quadratic programs using mixed-integer programming
- A tight compact quadratically constrained convex relaxation of the optimal power flow problem
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Quadratic convex reformulations for a class of complex quadratic programming problems
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- Global solution of quadratic problems using interval methods and convex relaxations
- scientific article; zbMATH DE number 7152114 (Why is no real title available?)
- Global solution of non-convex quadratically constrained quadratic programs
- Using general triangle inequalities within quadratic convex reformulation method
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems
- Extending the QCR method to general mixed-integer programs
- A model for clustering data from heterogeneous dissimilarities
- Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs
- Convex MIQP reformulations for semi-continuous quadratic programming with low price
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- A note on convex reformulation schemes for mixed integer quadratic programs
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Quadratic convex reformulations for semicontinuous quadratic programming
- Convex quadratic mixed-integer problems with quadratic constraints
- Compact mixed-integer programming formulations in quadratic optimization
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
This page was built for publication: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304240)
