Recovery of short, complex linear combinations via ℓ1 minimization

  • Authors:

  • J. A. Tropp

  • Affiliations:

  • ICES, Univ. of Texas, Austin, TX

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2005

Quantified Score

Hi-index 754.96

Visualization

Abstract

This note provides a condition under which lscr1 minimization (also known as basis pursuit) can recover short linear combinations of complex vectors chosen from fixed, overcomplete collection. This condition has already been established in the real setting by Fuchs, who used convex analysis. The proof given here is more direct