Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s10107-019-01399-8 | Mathematical Programming |
Keywords | Field | DocType |
Semidefinite programming, Quadratic optimization, Convex relaxation, Algebraic degree, 90C22 (primary), 14C17, 14P10, 68W30 (secondary) | Discrete mathematics,Applied mathematics,Algebraic number,Euclidean distance,Quadratic equation,Quadratic programming,Mathematics,Bundle | Journal |
Volume | Issue | ISSN |
182 | 1 | 0025-5610 |
Citations | PageRank | References |
1 | 0.43 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego Fernando Cifuentes | 1 | 6 | 1.89 |
| Corey Harris | 2 | 1 | 0.77 |
| Bernd Sturmfels | 3 | 926 | 136.85 |