On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (Q5219689): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:54, 8 February 2024
scientific article; zbMATH DE number 7179903
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation |
scientific article; zbMATH DE number 7179903 |
Statements
On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation (English)
0 references
12 March 2020
0 references
low-rank matrix approximations
0 references
binary matrix factorization
0 references
cut norm
0 references
computational complexity
0 references
