Containment Problems for Projections of Polyhedra and Spectrahedra

TL;DR

This paper studies the containment problem for projections of polyhedra and spectrahedra, formulating it as polynomial nonnegativity problems and developing hierarchies of semidefinite conditions to decide containment.

Contribution

It introduces a novel approach to containment problems by using polynomial nonnegativity and Positivstellensätze, extending previous results and connecting to positive linear maps.

Findings

Hierarchies of semidefinite conditions for containment

Extension of conditions from polyhedral to spectrahedral cases

Connections to positive linear map theory

Abstract

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.