Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling

Mariano Tepper, Anirvan M. Sengupta, Dmitri Chklovskii

In solving hard computational problems, semidefinite program (SDP) relaxations often play an important role because they come with a guarantee of optimality. Here, we focus on a po…