Semidefinite Optimization and Convex Algebraic Geometry 2012
DOI: 10.1137/1.9781611972290.ch6
|View full text |Cite
|
Sign up to set email alerts
|

Chapter 6: Semidefinite Representability

Abstract: It is natural to ask which convex optimization problems can be formulated as semidefinite programs. If such a formulation exists, how can we find it? The answer to these questions is equivalent to finding an exact representation of a convex set as a spectrahedron or projected spectrahedron. Whenever this can be done, we say that the convex set has a semidefinite representation or it is semidefinite representable. IntroductionWe begin by examining the question of when a convex set S is a spectrahedron. Since a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Remark 3.16. A closed convex cone K ⊆ R n is a spectrahedral shadow if and only if its dual cone is a spectrahedral shadow (Exercise 6.23 in [Nie13]). The dual cone of P + (S) is the closed conical hull of the image of R n under the monomial map given by the monomials from S.…”
Section: The Group Ring R[q N ]mentioning
confidence: 99%
“…Remark 3.16. A closed convex cone K ⊆ R n is a spectrahedral shadow if and only if its dual cone is a spectrahedral shadow (Exercise 6.23 in [Nie13]). The dual cone of P + (S) is the closed conical hull of the image of R n under the monomial map given by the monomials from S.…”
Section: The Group Ring R[q N ]mentioning
confidence: 99%