Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix (Q3067608)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5840055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix |
scientific article; zbMATH DE number 5840055 |
Statements
21 January 2011
0 references
PCA
0 references
rank minimization
0 references
nuclear norm minimization
0 references
sparse error
0 references
Douglas-Rachford splitting
0 references
greedy algorithms
0 references
0.8527384996414185
0 references
0.8164048790931702
0 references
0.790511965751648
0 references
0.7892820239067078
0 references
