A sub-constant improvement in approximating the positive semidefinite Grothendieck problem

Roy Frostig, Sida I. Wang

Semidefinite relaxations are a powerful tool for approximately solving combinatorial optimization problems such as MAX-CUT and the Grothendieck problem. By exploiting a bounded ran…