Department of Computer Science, Northwestern University, Evanston, IL 60208
Liam O'Carroll, Vaidehi Srinivas, Aravindan Vijayaraghavan
non-convex optimization;semidefinite programming;Burer-Monteiro;manifold optimization;low-rank SDP
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound