Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data |
scientific article; zbMATH DE number 7438275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data |
scientific article; zbMATH DE number 7438275 |
Statements
Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (English)
0 references
3 December 2021
0 references
convex relaxation
0 references
\( \ell_\infty\) guarantees
0 references
leave-one-out analysis
0 references
robust principal component analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8486760854721069
0 references
0.8369039297103882
0 references
0.8175645470619202
0 references
0.8160452246665955
0 references
