Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957): Difference between revisions

This article gives a natural generalization of the little Grothendieck problem, the little Grothendieck problem over the orthogonal group. The authors propose an approximation algorithm. The given method is based on semidefinite programming. Furthermore, an improved approximation algorithm is provided for the more general little Grothendieck problem over the orthogonal group with rank constraints.