The Geometry of SDP-Exactness in Quadratic Optimization
Not on the map. Why?
Abstract (arXiv)
Consider the problem of minimizing a quadratic objective subject to quadratic equations. We study the semialgebraic region of objective functions for which this problem is solved by its semidefinite relaxation. For the Euclidean distance problem, this is a bundle of spectrahedral shadows surrounding the given variety. We characterize the algebraic boundary of this region and we derive a formula for its degree.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3.
3 papers.