Sparse total least squares: analysis and greedy algorithms

DOI10.1016/j.laa.2012.10.032zbMath1271.65070OpenAlexW2005612579MaRDI QIDQ1938584

Bogdan Dumitrescu

Publication date: 21 February 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.10.032

zbMATH Keywords

greedy algorithmssparse solutionsorthogonal matching pursuitsparse total least squares

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Linear equations (linear algebraic aspects) (15A06)

Cites Work

• Unnamed Item
• Unnamed Item
• Overview of total least-squares methods
• Bounds for the least squares distance using scaled total least squares
• A numerical exploration of compressed sampling recovery
• Generalized power method for sparse principal component analysis
• Compressed Sensing: How Sharp Is the Restricted Isometry Property?
• Decoding by Linear Programming
• Sparse and Redundant Representations
• Orthogonal least squares methods and their application to non-linear system identification
• Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
• Sensitivity to Basis Mismatch in Compressed Sensing
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

This page was built for publication: Sparse total least squares: analysis and greedy algorithms