Convex approximations to sparse PCA via Lagrangian duality (Q631218)
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: Convex approximations to sparse PCA via Lagrangian duality |
scientific article; zbMATH DE number 5869208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex approximations to sparse PCA via Lagrangian duality |
scientific article; zbMATH DE number 5869208 |
Statements
Convex approximations to sparse PCA via Lagrangian duality (English)
0 references
22 March 2011
0 references
sparse principal component analysis
0 references
convex programming
0 references
Lagrangian duality
0 references
0 references
0.8151149749755859
0 references
0.8086661100387573
0 references
0.7950038909912109
0 references
0.7852070331573486
0 references
0.7849475145339966
0 references
