Pages that link to "Item:Q2784376"
From MaRDI portal
The following pages link to Low-Rank Approximations with Sparse Factors I: Basic Algorithms and Error Analysis (Q2784376):
Displaying 8 items.
- Clustering and feature selection using sparse principal component analysis (Q374668) (← links)
- Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
- High-dimensional analysis of semidefinite relaxations for sparse principal components (Q834367) (← links)
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
- Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550) (← links)
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition (Q4969614) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
