Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations

DOI10.1137/S0895479801394477zbMATH Open1069.65050MaRDI QIDQ4650964FDOQ4650964

Hongyuan Zha, Zhenyue Zhang, Horst Simon

Publication date: 21 February 2005

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
• Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
• Algorithm 844
• Approximate low-rank factorization with structured factors
• A quadratically convergent algorithm for structured low-rank approximation

zbMATH Keywords

algorithmsnumerical examplessingular value decompositionNewton-like methodperturbation analysiscomparison of methodslow-rank matrix approximationsparse factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23)

Cited In (3)

• Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
• Clustering and feature selection using sparse principal component analysis
• Convex approximations to sparse PCA via Lagrangian duality

This page was built for publication: Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650964)