A Matrix Lee-Sidford Barrier and Faster Semidefinite ProgrammingResearch Paper
A semidefinite program (SDP) optimizes a linear function over the intersection of the cone of positive semidefinite matrices with an affine subspace. SDPs model relaxations of combinatorial problems, control and sum-of-squares certificates, and their fastest general-purpose solvers are interior point methods, which follow a central path defined by a self-con…