#### Event Title

### On the size of spectrahedral descriptions

#### Location

Crow 206

#### Start Date

7-21-2016 3:30 PM

#### End Date

21-7-2016 3:50 PM

#### Description

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron, we are interested in the question of the smallest possible size r of the matrices in the description by linear matrix inequalities. After some generalities, we focus on the case of convex regions defined by quadratic and cubic polynomials.

On the size of spectrahedral descriptions

Crow 206

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron, we are interested in the question of the smallest possible size r of the matrices in the description by linear matrix inequalities. After some generalities, we focus on the case of convex regions defined by quadratic and cubic polynomials.