Thresholds for the recovery of sparse solutions via L1 minimization

The ubiquitous least squares method for systems of linear equations returns solutions which typically have all non-zero entries. However, solutions with the least number of non-zeros allow for greater insight. An exhaustive search for the sparsest solution is intractable, NP-hard. Recently, a great deal of research showed that linear programming can find the sparsest solution for certain 'typical' systems of equations, provided the solution is sufficiently sparse. In this note we report recent progress determining conditions under, which the sparsest solution to large systems is available by linear programming, [1]-[3]. Our work shows that there are sharp thresholds on sparsity below which these methods will succeed and above which they rail; it evaluates those thresholds precisely and hints at several interesting applications.