Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation |
scientific article |
Statements
Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (English)
0 references
30 September 2021
0 references
matrix completion
0 references
convex optimization
0 references
semidefinite programming
0 references
semidefinite programming hierarchies
0 references
duality in optimization
0 references
sum-of-squares polynomials
0 references
0 references
0 references
0 references
0 references
0 references
0 references
