Approximating the little Grothendieck problem over the orthogonal and unitary groups
The little Grothendieck problem consists of maximizing ∑[subscript ij]C[subscript ij]x[subscript i]x[subscript j] for a positive semidefinite matrix C, over binary variables x[subscript i]∈{±1}. In this paper we focus on a natural generalization of this problem, the little Grothendieck problem over...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg,
2016-10-06T21:02:34Z.
|
| Subjects: | |
| Online Access: | Get fulltext |