2000 character limit reached
Spectrahedra and Convex Hulls of Rank-One Elements
Published 6 Jan 2015 in math.OC and math.AG | (1501.01057v1)
Abstract: The Helton-Nie Conjecture (HNC) is the proposition that every convex semialgebraic set is a spectrahedral shadow. Here we prove that HNC is equivalent to another propo- sition related to quadratically constrained quadratic programming. Namely, that the convex hull of the rank-one elements of any spectrahedron is a spectrahedral shadow. In the case of compact convex semialgebraic sets, the spectrahedra may be taken to be compact. We illustrate the relationship between spetrahedra and these convex subsets with examples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.