D.C. versus copositive bounds for standard QP
From MaRDI portal
Publication:2583183
DOI10.1007/s10898-004-4312-0zbMath1093.90033MaRDI QIDQ2583183
Kurt M. Anstreicher, Samuel Burer
Publication date: 13 January 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-4312-0
90C20: Quadratic programming
Related Items
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, The semi-continuous quadratic mixture design problem: description and branch-and-bound approach, Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
Cites Work
- Branch-and-bound approaches to standard quadratic optimization problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Approximation of the Stability Number of a Graph via Copositive Programming
- A comparison of the Delsarte and Lovász bounds
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On copositive programming and standard quadratic optimization problems