Positive Semidefinite Rank of Polytopes
Seminar Room 1, Newton Institute
AbstractWe define the positive semidefinite (psd) rank of a polytope P to be the size of the smallest cone of psd matrices that admits a lift of P. This can be thought of as a measure on how well semidefinite programming may be used to optimize over P. We will present an overview of the subject, several recent results, and some open problems.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.