Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
From MaRDI portal
Publication:6106165
DOI10.1007/s11634-022-00499-2MaRDI QIDQ6106165
Juan Carlos Vera, Klaas Sijtsma, Anya Tonne, Rosember Guerra-Urzola, Katrijn Van Deun, Niek C. de Schipper
Publication date: 27 June 2023
Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse Principal Component Analysis via Variable Projection
- Best subset selection via a modern optimization lens
- Sparse principal component analysis subject to prespecified cardinality of loadings
- Sparse principal component analysis via regularized low rank matrix approximation
- Principal component analysis.
- Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems
- A guide for sparse PCA: model comparison and applications
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Rejoinder: ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
- From simple structure to sparse components: a review
- Certifiably optimal sparse principal component analysis
- Generalized power method for sparse principal component analysis
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Sparse Approximate Solutions to Linear Systems
- Regularization and Variable Selection Via the Elastic Net
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint
