The geometry of SDP-exactness in quadratic optimization

9Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

References Powered by Scopus

Improved Approximation Algorithms for Maximum Cut and Satisflability Problems Using Semidefinite Programming

2568Citations
N/AReaders
Get full text

Global optimization with polynomials and the problem of moments

1853Citations
N/AReaders
Get full text

The Euclidean Distance Degree of an Algebraic Variety

141Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Advances in Inference and Representation for Simultaneous Localization and Mapping

55Citations
N/AReaders
Get full text

On the local stability of semidefinite relaxations

10Citations
N/AReaders
Get full text

On the Tightness of Semidefinite Relaxations for Rotation Estimation

10Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Cifuentes, D., Harris, C., & Sturmfels, B. (2020). The geometry of SDP-exactness in quadratic optimization. Mathematical Programming, 182(1–2), 399–428. https://doi.org/10.1007/s10107-019-01399-8

Readers over time

‘18‘19‘20‘21‘22‘2401234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 8

80%

Professor / Associate Prof. 1

10%

Researcher 1

10%

Readers' Discipline

Tooltip

Engineering 4

36%

Computer Science 3

27%

Mathematics 3

27%

Decision Sciences 1

9%

Save time finding and organizing research with Mendeley

Sign up for free
0