Large Structures Seminar: Thorsten Theobald

This talk is part of the AScI Thematic program "Challenges in Large Geometric Structures and Big Data" seminar. Check out our upcomning talks at https://aaltoscienceinst.github.io/lsbdseminar/.

Where:	AScI lounge (TUAS 3161, 3rd floor)
When:	02.03.2015 @ 12.30 (sharp!)

Speaker:	Thorsten Theobald Goethe Universität Frankfurt
Title:	Polyhedra, spectrahedra and the question of containment

Polyhedra (or in the bounded cases polytopes) are the feasible regions of linear programs. Generalizing this notion, spectrahedra are defined as the feasible regions of semidefinite programs. In this talk, we first provide some general insights into the emerging world of spectrahedra. Then we study the computational question whether a given polytope or spectrahedron $S_A$ (as given by the positive semidefiniteness region of a linear matrix pencil $A(x)$ ) is contained in another one $S_B$ .

(Joint work with Kai Kellner and Christian Trabandt.)