S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing, 2013.

C. Ekanadham, D. Tranchina, and E. P. Simoncelli, Recovery of sparse translation-invariant signals with continuous basis pursuit, IEEE Transactions on Signal Processing, vol.59, issue.10, pp.4735-4744, 2011.

E. J. Candès and C. Fernandez-granda, Towards a Mathematical Theory of Super-resolution, vol.67, pp.906-956, 2014.

V. Duval and G. Peyré, Exact Support Recovery for Sparse Spikes Deconvolution, vol.15, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00839635

Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, vol.1, pp.40-44, 1993.

B. Natarajan, Sparse approximate solutions to linear systems, SIAM Journal on Computing, vol.24, issue.2, pp.227-234, 1995.

A. J. Miller, Subset selection in regression, 2002.

S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993.

R. A. Devore and V. N. Temlyakov, Some remarks on greedy algorithms, Advances in Computational Mathematics, vol.5, issue.1, pp.173-187, 1996.

E. Liu and V. N. Temlyakov, The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing, IEEE Transactions on Information Theory, vol.58, issue.4, pp.2040-2047, 2012.

S. Chen, S. A. Billings, and W. Luo, Orthogonal least squares methods and their application to non-linear system identification, International Journal of Control, vol.50, issue.5, pp.1873-1896, 1989.

J. H. Friedman and W. Stuetzle, Projection pursuit regression, Journal of the American Statistical Association, vol.76, issue.376, pp.817-823, 1981.
DOI : 10.1080/01621459.1981.10477729

P. J. Huber, Projection pursuit, The Annals of Statistics, vol.13, issue.2, pp.435-475, 1985.

L. Rebollo-neira and D. Lowe, Optimized orthogonal matching pursuit approach, IEEE Signal Processing Letters, vol.9, issue.4, pp.137-140, 2002.
DOI : 10.1109/lsp.2002.1001652
URL : https://publications.aston.ac.uk/id/eprint/38228/1/ieeespl02.pdf

V. N. Temlyakov, Greedy approximation, Acta Numerica, vol.17, pp.235-409, 2008.
DOI : 10.1017/cbo9780511762291

P. Vincent and Y. Bengio, Kernel Matching Pursuit, Machine Learning, vol.48, issue.3, pp.165-187, 2002.

J. F. Claerbout and F. Muir, Robust modeling with erratic data, Geophysics, vol.38, issue.5, pp.826-844, 1973.
DOI : 10.1190/1.1440378

S. Chen, D. Donoho, and M. Saunders, Atomic decomposition by basis pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1998.
DOI : 10.1137/s003614450037906x

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society. Series B (Methodological), vol.58, issue.1, pp.267-288, 1996.
DOI : 10.1111/j.2517-6161.1996.tb02080.x

R. Tibshirani, I. Johnstone, T. Hastie, and B. Efron, Least angle regression, The Annals of Statistics, vol.32, issue.2, pp.407-499, 2004.

A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, pp.183-202, 2009.

S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Foundations and Trends® in Machine Learning, vol.3, issue.1, pp.1-122, 2011.

R. Gribonval and P. Vandergheynst, On the exponential convergence of matching pursuits in quasi-incoherent dictionaries, IEEE Transactions on Information Theory, vol.52, issue.1, pp.255-261, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00544945

L. Borup, R. Gribonval, and M. Nielsen, Beyond coherence: Recovering structured time-frequency representations, Applied and Computational Harmonic Analysis, vol.24, issue.1, pp.120-128, 2008.
DOI : 10.1016/j.acha.2007.09.002
URL : https://hal.archives-ouvertes.fr/inria-00544766

K. C. Knudson, J. Yates, A. Huk, and J. W. Pillow, Inferring sparse representations of continuous signals with continuous orthogonal matching pursuit, Advances in Neural Information Processing Systems, vol.27, pp.1215-1223, 2014.

C. Dorffer, A. Drémeau, and C. Herzet, Efficient atom selection strategy for iterative sparse approximations, iTWIST 2018 -International Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques, pp.1-3, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01937501

Y. Castro and F. Gamboa, Exact reconstruction using Beurling minimal extrapolation, Journal of Mathematical Analysis and Applications, vol.395, issue.1, pp.336-354, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678423

K. Bredies and H. K. Pikkarainen, Inverse problems in spaces of measures, ESAIM: Control, Optimisation and Calculus of Variations, vol.19, pp.190-218, 2012.

N. Boyd, G. Schiebinger, and B. Recht, The alternating descent conditional gradient method for sparse inverse problems, 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), pp.57-60, 2015.
DOI : 10.1109/camsap.2015.7383735
URL : http://arxiv.org/pdf/1507.01562

Q. Denoyelle, V. Duval, and G. Peyré, Support Recovery for Sparse SuperResolution of Positive Measures, Journal of Fourier Analysis and Applications, vol.23, issue.5, pp.1153-1194, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01270184

J. A. Tropp, Greed is good: Algorithmic results for sparse approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.
DOI : 10.1109/tit.2004.834793
URL : http://users.cms.caltech.edu/~jtropp/papers/Tro04-Greed-Good.pdf

C. Soussen, R. Gribonval, J. Idier, and C. Herzet, Joint k-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares, IEEE Transactions on Information Theory, vol.59, issue.5, pp.3158-3174, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00637003

J. ,

. Fuchs, On sparse representations in arbitrary redundant bases, IEEE Transactions on Information Theory, vol.50, issue.6, pp.1341-1344, 2004.
DOI : 10.1109/tit.2004.828141
URL : http://www.irisa.fr/temics/staff/fuchs/osr-it04.pdf

J. A. Tropp, Just relax: convex programming methods for identifying sparse signals in noise, IEEE Transactions on Information Theory, vol.52, issue.3, pp.1030-1051, 2006.

R. Gribonval and M. Nielsen, Sparse representations in unions of bases, vol.49, pp.3320-3325, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071943

S. Huang and J. Zhu, Recovery of sparse signals using OMP and its variants: convergence analysis based on RIP, Inverse Problems, vol.27, issue.3, p.35003, 2011.
DOI : 10.1088/0266-5611/27/3/035003

R. Maleh, Improved RIP Analysis of Orthogonal Matching Pursuit, 2011.

Q. Mo and Y. Shen, A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.6, pp.3654-3656, 2012.

J. Wang and B. Shim, On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit, IEEE Transactions on Signal Processing, vol.60, issue.9, pp.4973-4976, 2012.

L. Chang and J. Wu, An Improved RIP-Based Performance Guarantee for Sparse Signal Recovery via Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.60, issue.9, pp.5702-5715, 2014.

J. Wen, X. Zhu, and D. Li, Improved bounds on restricted isometry constant for orthogonal matching pursuit, Electronics Letters, vol.49, issue.23, pp.1487-1489, 2013.

Q. Mo, A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit, Tech. rep, 2015.

C. Fernandez-granda, Super-resolution of point sources via convex programming, Information and Inference: A, Journal of the IMA, vol.5, issue.3, pp.251-303, 2016.

V. I. Morgenshtern and E. J. Candès, Super-resolution of positive sources: The discrete setup, SIAM Journal on Imaging Sciences, vol.9, issue.1, pp.412-444, 2016.

T. Bendory, Robust Recovery of Positive Stream of Pulses, IEEE Transactions on Signal Processing, vol.65, issue.8, 2017.

C. Poon and G. Peyré, Multi-dimensional sparse super-resolution, 2017.

T. Zhang, Sparse Recovery With Orthogonal Matching Pursuit Under RIP, IEEE Transactions on Information Theory, vol.57, issue.9, pp.6215-6221, 2011.

S. Foucart, Stability and Robustness of Weak Orthogonal Matching Pursuits, Springer Proceedings in Mathematics & Statistics, pp.395-405, 2012.

M. Merkle, Completely Monotone Functions: A Digest, p.347, 2014.

K. S. Miller and S. G. Samko, Completely monotonic functions, Integral Transforms and Special Functions, vol.12, issue.4, pp.389-402, 2001.

S. Bernstein, Sur les fonctions absolument monotones, Acta Mathematica, vol.52, pp.1-66, 1929.

D. V. Widder and L. Transform, , 1941.

H. Wendland, Scattered data approximation, 2005.

N. Aronszajn, Theory of reproducing kernels, vol.68, pp.337-337, 1950.

B. Mailhé, B. Sturm, and M. D. Plumbley, Behavior of greedy sparse representation algorithms on nested supports, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.5710-5714, 2013.

M. Belkin and K. Sinha, Learning Gaussian Mixtures with Arbitrary Separation

J. Wang and B. Shim, Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?, IEEE Transactions on Signal Processing, vol.64, issue.16, pp.4194-4202, 2016.

D. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory, 2005.

H. Fejzi´cfejzi´c, C. Freiling, and D. Rinne, Descartes' rule of signs, alternations of data sets, and balanced differences, The American Mathematical Monthly, vol.116, issue.4, pp.316-327, 2009.

G. Pólya, Proceedings of the [First] Berkeley Symposium on Mathematical Statistics and Probability, pp.115-123, 1949.