activity
20102023
most citedUniqueness of Tensor Decompositions with Applications to Polynomial Identifiability

28 citations · 130 across the 32 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

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…