Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
From MaRDI portal
Publication:2458903
DOI10.1007/s11590-006-0018-1zbMath1135.90377arXivmath/0503174OpenAlexW2143251621MaRDI QIDQ2458903
Immanuel M. Bomze, Martin Rubey, Florian Frommlet
Publication date: 5 November 2007
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0503174
Related Items
Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization, A clique algorithm for standard quadratic programming, Separable standard quadratic optimization problems, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
Uses Software
Cites Work
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- D.C. versus copositive bounds for standard QP
- On copositive programming and standard quadratic optimization problems
- Unnamed Item
- Unnamed Item
