mlsanityData to 14 Oct 2026

Containment Problems for Projections of Polyhedra and Spectrahedra

arXiv 1509.02735 ↗First posted 9 Sep 2015math.OC math.CO math.MGcited by 2

Not on the map. Why?

Abstract (arXiv)

Spectrahedra are affine sections of the cone of positive semidefinite matrices which form a rich class of convex bodies that properly contains that of polyhedra. While the class of polyhedra is closed under linear projections, the class of spectrahedra is not. In this paper we investigate the problem of deciding containment of projections of polyhedra and spectrahedra based on previous works on containment of spectrahedra. The main concern is to study these containment problems by formulating them as polynomial nonnegativity problems. This allows to state hierarchies of (sufficient) semidefinite conditions by applying (and proving) sophisticated Positivstellens"atze. We also extend results on a solitary sufficient condition for containment of spectrahedra coming from the polyhedral situation as well as connections to the theory of (completely) positive linear maps.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Sep 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

2 papers.