Tropp, Joel A. (2005) Recovery of short, complex linear combinations via ℓ1 minimization. IEEE Transactions on Information Theory, 2005 (4). pp. 1568-1570. ISSN 0018-9448. http://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b
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 remarks|
|Subject Keywords:||Algorithms, approximation, basis pursuit, linear program, redundant dictionaries, sparse representations|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||22 Oct 2007|
|Last Modified:||06 Mar 2015 23:13|
Repository Staff Only: item control page