Published April 2005
| public
Journal Article
Open
Recovery of short, complex linear combinations via ℓ1 minimization
- Creators
-
Tropp, Joel A.
Abstract
This note provides a condition under which ℓ1 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.
Additional Information
© Copyright 2005 IEEE. Reprinted with permission. Manuscript received June 9, 2004; revised January 12, 2005. [Posted online: 2005-04-04] This work was supported by a National Science Foundation Graduate Fellowship. Communicated by V. A. Vaishampayan, Associate Editor At Large. The author wishes to thank both anonymous referees for their insightful remarksFiles
TROieeetit05b.pdf
Files
(120.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:adea16e5b530990fb3d632f08b2d0cb9
|
120.3 kB | Preview Download |
Additional details
- Eprint ID
- 9039
- Resolver ID
- CaltechAUTHORS:TROieeetit05b
- Created
-
2007-10-22Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field