Co-occurring keywords · papers mentioning both
Papers
Polynomial time guarantees for the Burer-Monteiro method
NeurIPS 2022
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
NeurIPS 2022
Inference in Graphical Models via Semidefinite Programming Hierarchies
NeurIPS 2017
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
NeurIPS 2016