Convex Relaxations of (0, 1)-Quadratic Programming

DOI10.1287/moor.20.3.550zbMath0845.90089OpenAlexW2103574112MaRDI QIDQ4864871

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

zbMATH Keywords

\((0,1)\)-quadratic programmingparametric relaxations

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (23)

An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions ⋮ Using the eigenvalue relaxation for binary least-squares estimation problems ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming ⋮ Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Lifted polymatroid inequalities for mean-risk optimization with indicator variables ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Best ellipsoidal relaxation to solve a nonconvex problem. ⋮ On duality gap in binary quadratic programming ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ New bounds on the unconstrained quadratic integer programming problem ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ On the indefinite quadratic bilevel programming problem. ⋮ Semidefinite programming and combinatorial optimization ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ On the gap between the quadratic integer programming problem and its semidefinite relaxation ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ Parametric Lagrangian dual for the binary quadratic programming problem ⋮ Convex reformulation for binary quadratic programming problems via average objective value maximization ⋮ A global continuation algorithm for solving binary quadratic programming problems ⋮ A continuation approach for solving binary quadratic program based on a class of NCP-functions

This page was built for publication: Convex Relaxations of (0, 1)-Quadratic Programming