Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm

DOI10.1109/TIT.2015.2448690zbMath1359.94112arXiv1111.1396OpenAlexW2964247855MaRDI QIDQ2977308

Amir Salman Avestimehr, Weiyu Xu, M. Amin Khajehnejad, Babak Hassibi

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.1396

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (3)

Compressed sensing with coherent and redundant dictionaries ⋮ Classification of the entangled states of \(2 \times L \times M \times N\) ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations

This page was built for publication: Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm