Fetching the paper…
Reading the bibliography…
We propose novel necessary and sufficient conditions for a sensing matrix to be "$s$-good" - to allow for exact $\ell_1$-recovery of sparse signals with $s$ nonzero entries when no measurement noise is present.
Tibshirani, R. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society, Series B. 58
1996
Earlier work this paper cites.
Ben-Tal, A., Nemirovski, A., Lectures on Modern Convex Optimization
2001
Earlier work this paper cites.
Donoho, D. Huo, X., Uncertainty principles and ideal atomic decomposition. IEEE Transactions on Information Theory
2001
Earlier work this paper cites.
Donoho, D. High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension
2004
Earlier work this paper cites.
Donoho, D. Neighborly polytopes and sparse solutions of underdetermined linear equations
2004
Earlier work this paper cites.
Fuchs, J.-J. On sparse representations in arbitrary redundant bases, IEEE Trans. Inf. Theory
2004
Earlier work this paper cites.
Nemirovski, A., Prox-method with rate of convergence O ( 1 / t ) O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM Journal on Optimization
2004
Earlier work this paper cites.
Candès, E.J., Romberg, J., Tao, T. Signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math
2005
Earlier work this paper cites.
Fuchs, J.-J. Recovery of exact sparse representations in the presence of bounded noise, IEEE Trans. Inf. Theory
2005
Cited alongside, same era.
Zhang, Y. A simple proof for recoverability of ell-1-minimization: go over or under?
2005
Cited alongside, same era.
Candès, E.J., Tao, T. Decoding by linear programming. IEEE Trans. Inform. Theory
2006
Cited alongside, same era.
Candès, E.J., Tao, T. Near-optimal signal recovery from random projections and universal encoding strategies. IEEE Trans. Inform. Theory
2006
Cited alongside, same era.
Candès, E.J. Compressive sampling. Marta Sanz-Solé, Javier Soria, Juan Luis Varona, Joan Verdera, Eds. International Congress of Mathematicians, Madrid 2006
2006
Cited alongside, same era.
Tropp, J.A. Just relax: Convex programming methods for identifying sparse signals, IEEE Trans. Info. Theory
2006
Later among the works it cites.
Bickel, P.J. Discussion of The Dantzig selector: statistical estimation when p p is much larger than n n , by E.J. Candes and T. Tao. Annals of Stat
2007
Later among the works it cites.
Candès E.J., Tao. T. The Dantzig selector: statistical estimation when p p is much larger than n n . Annals of Stat
2007
Later among the works it cites.
DeVore, R. Deterministic Constructions of Compressed Sensing Matrices. Preprint, Department of Mathematics, University of South Carolina, (2007)
2007
Later among the works it cites.
Bickel P.J., Ritov, Ya., Tsybakov, A. Simultaneous analysis of Lasso and Dantzig selector, Annals of Stat
2008
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Donoho, D., Elad, M., Temlyakov V.N. Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Trans. Inf. Theory
2006
Cited alongside, same era.
Andersen, E. D., Andersen, K. D. The MOSEK optimization tools manual. Version 5.0
Cited in the paper.
Candès, E. J. The restricted isometry property and its implications for compressed sensing. Comptes Rendus de l’Acad. des Sci
2008
Closest in time.