Convex Relaxations of (0, 1)-Quadratic Programming
From MaRDI portal
DOI10.1287/MOOR.20.3.550zbMATH Open0845.90089OpenAlexW2103574112MaRDI QIDQ4864871FDOQ4864871
Authors: Svatopluk Poljak, Henry Wolkowicz 
Publication date: 16 September 1996
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1d9df42b9fb884152dc59141cb9426a8176ad016
Recommendations
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On convex relaxations for quadratically constrained quadratic programming
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Second order cone programming relaxation for quadratic assignment problems
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Quadratic programming (90C20) Convex programming (90C25) Combinatorial optimization (90C27) Boolean programming (90C09)
Cited In (29)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Using the eigenvalue relaxation for binary least-squares estimation problems
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Semidefinite programming for discrete optimization and matrix completion problems
- Best ellipsoidal relaxation to solve a nonconvex problem.
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Parametric Lagrangian dual for the binary quadratic programming problem
- A global continuation algorithm for solving binary quadratic programming problems
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints
- Semidefinite programming and combinatorial optimization
- On solving trust-region and other regularised subproblems in optimization
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Title not available (Why is that?)
- On convex relaxations for quadratically constrained quadratic programming
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- On duality gap in binary quadratic programming
- New bounds on the unconstrained quadratic integer programming problem
- On convex relaxations of quadrilinear terms
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On the indefinite quadratic bilevel programming problem.
This page was built for publication: Convex Relaxations of (0, 1)-Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864871)
