Pages that link to "Item:Q2802550"
From MaRDI portal
The following pages link to Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550):
Displayed 10 items.
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- Bayesian variable selection for globally sparse probabilistic PCA (Q1786585) (← links)
- An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking (Q2181395) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← 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)
- 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)