Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating the little Grothendieck problem over the orthogonal and unitary groups |
scientific article; zbMATH DE number 6656104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the little Grothendieck problem over the orthogonal and unitary groups |
scientific article; zbMATH DE number 6656104 |
Statements
Approximating the little Grothendieck problem over the orthogonal and unitary groups (English)
0 references
25 November 2016
0 references
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.
0 references
Grothendieck problem
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7792288661003113
0 references
0.7548749446868896
0 references
0.746758759021759
0 references
0.7455809712409973
0 references
0.7406634092330933
0 references
