Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041)
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: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization |
scientific article; zbMATH DE number 7118503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on matrix factorization ranks via noncommutative polynomial optimization |
scientific article; zbMATH DE number 7118503 |
Statements
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (English)
0 references
17 October 2019
0 references
matrix factorization ranks
0 references
nonnegative rank
0 references
positive semidefinite rank
0 references
completely positive rank
0 references
completely positive semidefinite rank
0 references
noncommutative polynomial optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
