The geometry of SDP-exactness in quadratic optimization
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 su...
Main Authors: | Cifuentes, Diego (Author), Harris, Corey (Author), Sturmfels, Bernd (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg,
2021-09-20T17:29:30Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
SDP Achieves Exact Minimax Optimality in Phase Synchronization
by: Gao, C., et al.
Published: (2022) -
SdpAB are required for post-translational modification of SdpC
by: Perez Morales, Tiara G
Published: (2010) -
Exact A-optimal designs for quadratic regression
by: YEH, YU RONG, et al.
Published: (1996) -
Dualities in convex algebraic geometry
by: Philipp Rostalski, et al.
Published: (2010-01-01) -
On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems
by: Benabbas, Siavosh
Published: (2012)