Pages that link to "Item:Q2802550"
From MaRDI portal
The following pages link to Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550):
Displaying 25 items.
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- The sparse principal component analysis problem: optimality conditions and algorithms (Q306306) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- 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)
- Bayesian variable selection for globally sparse probabilistic PCA (Q1786585) (← links)
- A guide for sparse PCA: model comparison and applications (Q2073736) (← links)
- An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking (Q2181395) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- Rate-optimal posterior contraction for sparse PCA (Q2343963) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Sparse PCA: optimal rates and adaptive estimation (Q2443213) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- Generalized power method for sparse principal component analysis (Q2896039) (← links)
- Sparse Variable PCA Using Geodesic Steepest Descent (Q4568879) (← links)
- Understanding large text corpora via sparse machine learning (Q4969899) (← links)
- (Q5054600) (← links)
- Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
- Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA (Q5103423) (← links)
- [HDDA] sparse subspace constrained partial least squares (Q5107373) (← links)
- (Q5347964) (← links)
- A Sparse Decomposition of Low Rank Symmetric Positive Semidefinite Matrices (Q5737757) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
