New semidefinite programming relaxations for box constrained quadratic program
From MaRDI portal
Publication:365811
DOI10.1007/S11425-012-4512-XzbMath1302.90135OpenAlexW2000645105MaRDI QIDQ365811
Publication date: 9 September 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-012-4512-x
semidefinite programmingzonotopelower boundbox constrained quadratic programD.C. optimizationLagrangian dual
Semidefinite programming (90C22) Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ Partially positive matrices ⋮ A class of differential quadratic programming problems ⋮ Parametric Lagrangian dual for the binary quadratic programming problem ⋮ An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- On duality gap in binary quadratic programming
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- Approximating quadratic programming with bound and quadratic constraints
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Reverse search for enumeration
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Semidefinite Programming
- A polynomial case of unconstrained zero-one quadratic optimization
This page was built for publication: New semidefinite programming relaxations for box constrained quadratic program
