Geometry of Polynomials

Project Description Given the algorithmic importance of semidefinite programming, the last two decades have seen increasing interest in characterizing which convex cones are spectrahedral (that is, feasible sets of semidefinite programming).