activity
20102022
most citedJ. Sally's question and a conjecture of Y. Shimoda

3 citations · 5 across the 7 of their papers we have counts for

collaborators
Showing 2022 · math.OCShow all

1 paper · 2 filters

math.OC2022★ 1 cited

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…