On the complexity of robust PCA and ℓ1-norm low-rank matrix approximation
Nicolas Gillis, Stephen A. Vavasis
| Year of publication: |
November 2018
|
|---|---|
| Authors: | Gillis, Nicolas ; Vavasis, Stephen A. |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 43.2018, 4, p. 1072-1084
|
| Subject: | robust PCA | low-rank matrix approximations | binary matrix factorization | cut norm | computational complexity | Theorie | Theory | Lineare Algebra | Linear algebra | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2017.0895 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011956898