NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

  • Authors:
  • Stephen Becker;Jérôme Bobin;Emmanuel J. Candès

  • Affiliations:
  • srbecker@acm.caltech.edu and bobin@acm.caltech.edu;-;emmanuel@acm.caltech.edu and candes@stanford.edu

  • Venue:
  • SIAM Journal on Imaging Sciences
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the recent field of compressed sensing is already quite immense. This paper applies a smoothing technique and an accelerated first-order algorithm, both from Nesterov [Math. Program. Ser. A, 103 (2005), pp. 127-152], and demonstrates that this approach is ideally suited for solving large-scale compressed sensing reconstruction problems as (1) it is computationally efficient, (2) it is accurate and returns solutions with several correct digits, (3) it is flexible and amenable to many kinds of reconstruction problems, and (4) it is robust in the sense that its excellent performance across a wide range of problems does not depend on the fine tuning of several parameters. Comprehensive numerical experiments on realistic signals exhibiting a large dynamic range show that this algorithm compares favorably with recently proposed state-of-the-art methods. We also apply the algorithm to solve other problems for which there are fewer alternatives, such as total-variation minimization and convex programs seeking to minimize the $\ell_1$ norm of $Wx$ under constraints, in which $W$ is not diagonal. The code is available online as a free package in the MATLAB language.