Friday, 15:45 - 16:10 h, Room: H 2036


Thorsten Theobald
Containment problems for polytopes and spectrahedra

Coauthors: Kai Kellner, Christian Trabandt


Spectrahedra are the feasible regions of semidefinite
programs. In this talk we study the computational
question(s) whether a given polytope or spectrahedron
SA (as given by a linear matrix pencil A(x)) is
contained in another one SB.
Our results both concern the computational complexity
(extending results on the polytope/polytope-case by
Gritzmann and Klee) as well as sufficient conditions
to certify containedness (whose study was initiated
by Ben-Tal, Nemirovski and Helton, Klep, McCullough).


Talk 2 of the invited session Fri.3.H 2036
"Algebraic geometry and conic programming III" [...]
Cluster 4
"Conic programming" [...]


  There are three major facts that should be watched out for in all payday loans in the United States. In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.