**Friday, 10:30 - 10:55 h, Room: H 2036**

**Tim Netzer**

Describing the feasible sets of semidefinite programming

**Coauthors: Daniel Plaumann, Andreas B. Thom**

**Abstract:**

The feasible sets of semidefinite programming, sometimes called

spectrahedra, are affine slices of the cone positive semidefinite matrices.

For a given convex set it might however be quite complicated to decide

whether it is such a slice or not. Alternative characterizations of

spectrahedra are thus highly desirable. This interesting problem turns out

to be related to algebra, algebraic geometry and non-commutative geometry. I

will explain some of the recent developments in the area.

Talk 1 of the invited session Fri.1.H 2036

**"Algebraic geometry and conic programming I"** [...]

Cluster 4

**"Conic programming"** [...]