A Note on the Convex Hull of Finitely Many Projections of Spectrahedra
Tim Netzer, Rainer Sinn

TL;DR
This paper proves that the convex hull of finitely many projections of spectrahedra remains a projection of a spectrahedron, extending previous results to unbounded sets and broadening the understanding of semidefinitely representable sets.
Contribution
It generalizes prior work by Helton and Nie, demonstrating that the convex hull of a finite union of projections of spectrahedra is also a projection of a spectrahedron, regardless of boundedness.
Findings
Convex hull of finite union of spectrahedron projections is a spectrahedral projection
Extends Helton and Nie's bounded set result to unbounded sets
Enhances understanding of semidefinitely representable sets
Abstract
A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of a spectrahedron. This improves upon the result of Helton and Nie, who prove the same result in the case of bounded sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Sparse and Compressive Sensing Techniques · Point processes and geometric inequalities
A Note on the Convex Hull of finitely many Projections of Spectrahedra
Tim Netzer
Fachbereich Mathematik, Universität Konstanz, 78457 Konstanz, Germany
and
Rainer Sinn
Fachbereich Mathematik, Universität Konstanz, 78457 Konstanz, Germany
(Date: March 16, 2024)
Abstract.
A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of a spectrahedron. This improves upon the result of Helton and Nie [3], who prove the same result in the case of bounded sets.
2000 Mathematics Subject Classification:
90C22, 14P10, 15A48
1. Introduction
Let be real symmetric matrices. The set
[TABLE]
where means positive semidefiniteness, is called a spectrahedron. Spectrahedra are generalizations of polyhedra and occur as feasible sets for semidefinite optimization.
A projection of a spectrahedron to a subspace of is often called a semidefinitely representable set. Helton and Nie [3] conjecture that every convex semialgebraic set is such a projection. See for example [1, 2, 3, 4, 5, 6, 7] for more detailed information on spectrahedra and their projections.
We prove that the convex hull of finitely many projections of spectrahedra is again a projection of a spectrahedron. This generalizes Theorem 2.2 from Helton and Nie [3], which is the same result in the case that all sets are bounded or that the convex hull is closed.
2. Result
Proposition 2.1**.**
If is a projection of a spectrahedron, then so is , the conic hull of .
Proof.
Since is a projection of a spectrahedron we can write
[TABLE]
with suitable real symmetric -matrices . Then with
[TABLE]
we have (note that is a projection of a spectrahedron, since the conjunction can be eliminated, using block matrices).
To see "" let some fulfill all the conditions from , first with some . Then belongs to , using the first condition only. Since , . If fulfills the conditions with , then , by the last conditions in the definition of . So clearly also .
For "" take . If then there is some and with . Now there is some with . Multiplying this equation with shows that fulfills the first condition in the definition of . But since , the other conditions can clearly also be satisfied with some big enough . So belongs to . Finally, belongs to too. ∎
Remark 2.2**.**
The additional conditions in the definition of avoid problems that could occur in the case This is the main difference to the approach of Helton and Nie in [3].
Corollary 2.3**.**
If are projections of spectrahedra, then also the convex hull is a projection of a spectrahedron.
Proof.
Consider , and let denote the conic hull of in . All and therefore all are projections of spectrahedra, and thus the Minkowski sum is also such a projection. Now one easily checks
[TABLE]
which proves the result. ∎
Example 2.4**.**
Let and . Both subsets of are spectrahedra, so the convex hull of their union,
[TABLE]
is a projection of a spectrahedron.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear matrix inequalities in system and control theory , vol. 15 of SIAM Studies in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994.
- 2[2] J. W. Helton and J. Nie. Semidefinite representation of convex sets. To appear in Math. Program.
- 3[3] ———. Sufficient and necessary conditions for semidefinite representability of convex sets. Preprint.
- 4[4] J. W. Helton and V. Vinnikov. Linear matrix inequality representation of sets. Comm. Pure Appl. Math. , 60 (5) , 654–674, 2007.
- 5[5] J. B. Lasserre. Convex sets with semidefinite representation. To appear in Math. Program.
- 6[6] T. Netzer. On semidefinite representations of sets. Preprint.
- 7[7] T. Netzer, D. Plaumann, and M. Schweighofer. Exposed faces of semidefinite representable sets. Preprint.
- 8[8] M. Ramana and A. J. Goldman. Some geometric results in semidefinite programming. J. Global Optim. , 7 (1) , 33–50, 1995.
