On the gap between the quadratic integer programming problem and its semidefinite relaxation
From MaRDI portal
Recommendations
- Semidefinite programming relaxations for the quadratic assignment problem
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- A semidefinite programming method for integer convex quadratic minimization
- scientific article; zbMATH DE number 3970529
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
- Semidefinite relaxations for integer programming
Cites work
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A polynomial case of unconstrained zero-one quadratic optimization
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Convex Relaxations of (0, 1)-Quadratic Programming
- Extremal problems on the set of nonnegative definite matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Improved approximations for max set splitting and max NAE SAT
- Laplacian eigenvalues and the maximum cut problem
- Maximally Robust Controllers for Multivariable Systems
- Minimum rank and minimum trace of covariance matrices
- Partition of Space
- Reverse search for enumeration
- Semidefinite relaxation and nonconvex quadratic optimization
- The vector partition problem for convex objective functions.
Cited in
(15)- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Parametric Lagrangian dual for the binary quadratic programming problem
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Immediate schedule adjustment and semidefinite relaxation
- Causal state-feedback parameterizations in robust model predictive control
- On linear conic relaxation of discrete quadratic programs
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- New semidefinite programming relaxations for box constrained quadratic program
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- On duality gap in binary quadratic programming
- An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Global optimality conditions and optimization methods for quadratic integer programming problems
- New bounds on the unconstrained quadratic integer programming problem
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
This page was built for publication: On the gap between the quadratic integer programming problem and its semidefinite relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492705)
