Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128467519, #quickstatements; #temporary_batch_1724872475876 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128467519 / rank | |||
Normal rank | |||
Revision as of 20:16, 28 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on matrix factorization ranks via noncommutative polynomial optimization |
scientific article |
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
