• Publications
  • Influence
Iteratively reweighted least squares minimization for sparse recovery
Under certain conditions (known as the restricted isometry property, or RIP) on the mN matrix ˆ (where m<N ), vectors x 2 R N that are sparse (i.e., have most of their entries equal to 0) can beExpand
  • 1,007
  • 88
  • PDF
Compressive Sensing
Compressive sensing is a new type of sampling theory, which predicts that sparse signals and images can be reconstructed from what was previously believed to be incomplete information. Expand
  • 1,115
  • 61
  • PDF
Compressive Sensing and Structured Random Matrices
  • 283
  • 38
Theoretical Foundations and Numerical Methods for Sparse Recovery
  • M. Fornasier
  • Computer Science
  • Radon Series on Computational and Applied…
  • 16 January 2010
The present collection of four lecture notes is the very first contribution of this type in the field of sparse recovery and may serve as a textbook for graduate courses. Expand
  • 332
  • 21
  • PDF
Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints
Regularization of ill-posed linear inverse problems via ℓ1 penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an ℓ1Expand
  • 271
  • 21
  • PDF
Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
We present and analyze an efficient implementation of an iteratively reweighted least squares algorithm for recovering a matrix from a small number of linear measurements with an error of the order of the best $k$-rank approximation. Expand
  • 175
  • 14
  • PDF
Continuous Frames, Function Spaces, and the Discretization Problem
A continuous frame is a family of vectors in a Hilbert space which allows reproductions of arbitrary elements by continuous superpositions. Associated to a given continuous frame we construct certainExpand
  • 130
  • 14
  • PDF
Iteratively Re-weighted Least Squares minimization: Proof of faster than linear rate for sparse recovery
We show that if there is a sparse solution, the limit of the proposed algorithm is that sparse solution. Expand
  • 109
  • 13
Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
We show how to compute solutions of linear inverse problems with joint sparsity regularization constraints by fast thresholded Landweber algorithms. Expand
  • 229
  • 12
  • PDF
Intrinsic Localization of Frames
AbstractSeveral concepts for the localization of a frame are studied. The intrinsic localization of a frame is defined by the decay properties of its Gramian matrix. Our main result asserts that theExpand
  • 101
  • 9
  • PDF