Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD

DOI10.1007/978-3-540-92182-0_38MaRDI QIDQ3596737zbMATH OpenOpenAlexFDO

Authors Malik Magdon-Ismail, Ali Çivril

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_38

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Near-optimal column-based matrix reconstruction
• Optimal column-based low-rank matrix reconstruction
• A Greedy Algorithm for Sparse Precision Matrix Approximation
• Sparse Approximation and Recovery by Greedy Algorithms
• Determinant-preserving sparsification of SDDM matrices
• Column subset selection via sparse approximation of SVD
• A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices
• Sparse recovery under matrix uncertainty
• On Sparse Vector Recovery Performance in Structurally Orthogonal Matrices via LASSO

Cited in

(5)

• A Greedy Algorithm for Sparse Precision Matrix Approximation
• Near-optimal column-based matrix reconstruction
• Optimal column-based low-rank matrix reconstruction
• Beyond symmetry: best submatrix selection for the sparse truncated SVD
• Column subset selection via sparse approximation of SVD

This page was built for publication: Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD

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