BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Semidefinite Programming and its Feasible Sets III - Netzer\, T (U
 niversitt Leipzig)
DTSTART:20130715T103000Z
DTEND:20130715T113000Z
UID:TALK46225@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In this lecture series I will first give a brief introduction 
 to semidefinite programming and some of its applications. I will then focu
 s on the class of feasible sets for such problems\, so-called spectrahedra
 \, and their linear projections. These sets are generalizations of polyhed
 ra. Although there exists an exact definition\, we so far do not have a sa
 tisfactory and easy-to-check characterization for them. The methods used i
 n finding such characterizations come from convexity theory\, optimization
 \, algebra\, algebraic geometry and functional analysis. This makes the ar
 ea an exciting field of research\, with many recent results\, and many int
 eresting results still to come.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR