S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAM Jour. on Scient. Comp, 1998.
DOI : 10.1137/s003614450037906x

R. Tibshirani, Regression shrinkage and selection via the Lasso, Journal of the Royal Statistical Society. Series B, 1996.
DOI : 10.1111/j.2517-6161.1996.tb02080.x

G. Gasso, A. Rakotomamonjy, and S. Canu, Recovering sparse signals with a certain family of nonconvex penalties and DC programming, IEEE Trans. on Sig. Proc, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00439453

L. Chen and Y. Gu, The convergence guarantees of a nonconvex approach for sparse recovery, IEEE Trans. on Sig. Proc, 2014.

Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition, 1993.
DOI : 10.1109/acssc.1993.342465
URL : http://www.isr.umd.edu/~krishna/images/pati_reza_psk.pdf

C. Ekanadham, D. Tranchina, and E. P. Simoncelli, Recovery of sparse translation-invariant signals with continuous basis pursuit, IEEE Trans. on Sig. Proc, 2011.
DOI : 10.1109/tsp.2011.2160058
URL : http://europepmc.org/articles/pmc3860587?pdf=render

E. J. Candès and C. Fernandez-granda, Towards a Mathematical Theory of Super-resolution, Communications on Pure and Applied Mathematics, 2014.

V. Duval and G. Peyré, Exact support recovery for sparse spikes deconvolution, Found. Comput. Math, 2015.
DOI : 10.1007/s10208-014-9228-6
URL : https://hal.archives-ouvertes.fr/hal-00839635

M. Merkle, Analytic Number Theory, Approximation Theory, and Special Functions, pp.347-364, 2014.

C. Elvira, R. Gribonval, C. Soussen, and C. Herzet, When does OMP achieve k-step recovery with continuous dictionaries, 2019.
DOI : 10.1109/icassp.2019.8683617

C. Elvira, R. Gribonval, C. Soussen, and C. Herzet, Omp and continuous dictionaries: Is k-step recovery possible, ICASSP 2019 -2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.5546-5550, 2019.
DOI : 10.1109/icassp.2019.8683617
URL : https://hal.archives-ouvertes.fr/hal-02049486

J. A. Tropp, Greed is good: algorithmic results for sparse approximation, IEEE Trans. on Inf. Th, 2004.
DOI : 10.1109/tit.2004.834793
URL : http://users.cms.caltech.edu/~jtropp/papers/Tro04-Greed-Good.pdf

, Just relax: convex programming methods for identifying sparse signals in noise, IEEE Trans. on Inf. Th, vol.52, issue.3, pp.1030-1051, 2006.