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). One particular class of convex cones are hyperbolicity cones (defined by hyperbolic polynomials), which has connections to several areas of mathematics.