Positive semidefinite lifts and factorizations
Introductory Workshop: Geometric and Topological Combinatorics September 05, 2017 - September 08, 2017
Location: MSRI: Simons Auditorium
Representing polytopes by means of linear matrix inequalities as been a highly successful strategy in combinatorial optimization. Geometrically it corresponds to writing a polytope as the projection of an affine slice of the cone of positive semidefinite (psd) matrices i.e., a spectrahedron. Efforts to understand the theoretical limits of such techniques have connected the existance of such representations to a particular type of matrix factorization, the psd factorization of a nonnegative matrix, and its corresponding notion of psd rank. In this talk we will do a brief survey of the main results in the area, its connections to matrix theory and combinatorics and some of the open problems that remain.
If none of the options work for you, you can always buy the DVD of this lecture. The videos are sold at cost for $20USD (shipping included). Please Click Here to send an email to MSRI to purchase the DVD.
See more of our Streaming videos on our main VMath - Streaming Video page.