Low-Rank Approximations with Sparse Factors I: Basic Algorithms and Error Analysis
From MaRDI portal
Publication:2784376
DOI10.1137/S0895479899359631zbMath1003.65041MaRDI QIDQ2784376
Hongyuan Zha, Horst D. Simon, Zhenyue Zhang
Publication date: 23 April 2002
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
algorithmssingular value decompositionnumerical experimentserror analysissparse factorizationperturbation analysislow-rank matrix approximation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
High-dimensional analysis of semidefinite relaxations for sparse principal components ⋮ Clustering and feature selection using sparse principal component analysis ⋮ Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA ⋮ Convex approximations to sparse PCA via Lagrangian duality ⋮ Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method ⋮ Sparse PCA: Convex Relaxations, Algorithms and Applications ⋮ Less is More: Sparse Graph Mining with Compact Matrix Decomposition ⋮ Do semidefinite relaxations solve sparse PCA up to the information limit?
This page was built for publication: Low-Rank Approximations with Sparse Factors I: Basic Algorithms and Error Analysis
