202 citations · 1.3k across the 61 of their papers we have counts for
Showing 2016 · math.OCShow all
2 papers · 2 filters
math.OC2016★ 33 cited
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
Nicolas Boumal, Vladislav Voroninski, Afonso S. Bandeira
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods, but scalability can be an issue. To address this shortcoming, over a decade ago, Burer and…
math.OC2016★ 87 cited
On the low-rank approach for semidefinite programs arising in synchronization and community detection
Afonso S. Bandeira, Nicolas Boumal, Vladislav Voroninski
To address difficult optimization problems, convex relaxations based on semidefinite programming are now common place in many fields. Although solvable in polynomial time, large se…