An IHT Algorithm for Sparse Recovery From Subexponential Measurements

Abstract

A matrix whose entries are independent subexponential random variables is not likely to satisfy the classical restricted isometry property in the optimal regime of parameters. However, it is known that uniform sparse recovery is still possible with high probability in the optimal regime if ones uses $\ell _1$ -minimization as a recovery algorithm. We show in this letter that such a statement remains valid if one uses a new variation of iterative hard thresholding as a recovery algorithm. The argument is based on a modified restricted isometry property featuring the $\ell _1$ -norm as the inner norm.