On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation (Q5219689)
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 7179903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of robust PCA and \(\ell_1\)-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
0.7874419093132019
0 references
0.7858507037162781
0 references
0.7691686153411865
0 references
0.7672626376152039
0 references
0.7615895867347717
0 references
