Computable quantification of the stability of sparse signal reconstruction

Gongguo Tang, Arye Nehorai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The ℓ1-constrained minimal singular value (ℓ1-CMSV) of the sensing matrix is shown to determine, in a concise and tight manner, the recovery performance of ℓ1-based algorithms such as Basis Pursuit, the Dantzig selector, and the LASSO estimator. Several random measurement ensembles are shown to have ℓ1-CMSVs bounded away from zero with high probability, as long as the number of measurements is relatively large. Three algorithms based on projected gradient method and interior point algorithm are developed to compute ℓ1-CMSV. A lower bound of the ℓ1-CMSV is also available by solving a semi-definite programming problem.

Original languageEnglish
Title of host publicationConference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
Pages248-252
Number of pages5
DOIs
StatePublished - 2010
Event44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010 - Pacific Grove, CA, United States
Duration: Nov 7 2010Nov 10 2010

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Conference

Conference44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
Country/TerritoryUnited States
CityPacific Grove, CA
Period11/7/1011/10/10

Keywords

  • Basis Pursuit
  • Dantzig selector
  • LASSO estimator
  • random measurement ensemble
  • semidefinite relaxation
  • sparse signal reconstruction
  • ℓ-constrained minimal singular value

Fingerprint

Dive into the research topics of 'Computable quantification of the stability of sparse signal reconstruction'. Together they form a unique fingerprint.

Cite this