2015/09/09 by Kai Kellner, Kellner, Kai · 1 citation
Computer Science · Engineering · Mathematics · #14P10 #52A20 (Secondary) #52B55 #90C22 (Primary) #Advanced Optimization Algorithms Research #Advanced Theoretical and Applied Studies in Material Sciences and Geometry #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.1509.02735
openalex publication_date 2015/09/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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ätze. 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.