Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 19, 2011 | public
Report Open

Computational Methods for Sparse Solution of Linear Inverse Problems

Abstract

In sparse approximation problems, the goal is to find an approximate representation of a target signal using a linear combination of a few elementary signals drawn from a fixed collection. This paper surveys the major algorithms that are used for solving sparse approximation problems in practice. Specific attention is paid to computational issues, to the circumstances in which individual methods tend to perform well, and to the theoretical guarantees available. Many fundamental questions in electrical engineering, statistics, and applied mathematics can be posed as sparse approximation problems, which makes the algorithms discussed in this paper versatile tools with a wealth of applications.

Additional Information

JAT was supported by ONR N00014-08-1-2065. SJW was supported by NSF CCF-0430504, DMS-0427689, CTS-0456694, and CNS-0540147.

Files

Caltech_ACM_TR_2009_01.pdf
Files (345.8 kB)
Name Size Download all
md5:9d57a171626adde35acd9c965bdd76b2
345.8 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
January 13, 2024