The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound

Liam O'Carroll, Vaidehi Srinivas, Aravindan Vijayaraghavan

The most widely used technique for solving large-scale semidefinite programs (SDPs) in practice is the non-convex Burer-Monteiro method, which explicitly maintains a low-rank SDP s…