B. K. Natarajan, Sparse Approximate Solutions to Linear Systems, SIAM Journal on Computing, vol.24, issue.2, pp.227-234, 1995.
DOI : 10.1137/S0097539792240406

S. Chen, D. L. Donoho, and M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1999.
DOI : 10.1137/S1064827596304010

I. Gorodnitsky and D. R. Bhaskar, Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm, IEEE Transactions on Signal Processing, vol.45, issue.3, pp.600-616, 1997.
DOI : 10.1109/78.558475

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.5769

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, 1993.
DOI : 10.1109/ACSSC.1993.342465

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.10, issue.5, pp.1873-1896, 1989.
DOI : 10.2307/2284566

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://authors.library.caltech.edu/9035/1/TROieeetit04a.pdf

M. A. Davenport and M. B. Wakin, Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4395-4401, 2010.
DOI : 10.1109/TIT.2010.2054653

J. A. Tropp and A. C. Gilbert, Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.53, issue.12, pp.4655-4666, 2007.
DOI : 10.1109/TIT.2007.909108

S. Foucart, Stability and Robustness of Weak Orthogonal Matching Pursuits, AMS Spring, Southern Conference, 2011.
DOI : 10.1007/978-1-4614-4565-4_30

D. L. Donoho, Y. Tsaig, I. Drori, and J. Starck, Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.2, pp.1094-1121, 2012.
DOI : 10.1109/TIT.2011.2173241

T. Blumensath and M. E. Davies, On the difference between orthogonal matching pursuit and orthogonal least squares, Tech. Rep, 2007.

C. Soussen, R. Gribonval, J. Idier, and C. Herzet, Joint k-step analysis of orthogonal matching pursuit and orthogonal least squares, Tech. Rep, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00637003

T. T. Cai, L. Wang, and G. Xu, Stable Recovery of Sparse Signals and an Oracle Inequality, IEEE Transactions on Information Theory, vol.56, issue.7, pp.3516-3522, 2010.
DOI : 10.1109/TIT.2010.2048506

D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ??1 minimization, Proceedings of the National Academy of Sciences, pp.2197-2202, 2003.
DOI : 10.1073/pnas.0437847100

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

M. D. Plumbley, On Polar Polytopes and the Recovery of Sparse Representations, IEEE Transactions on Information Theory, vol.53, issue.9, pp.3188-3195, 2007.
DOI : 10.1109/TIT.2007.903129

URL : https://hal.archives-ouvertes.fr/hal-00839327

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

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

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.
DOI : 10.1109/TIT.2011.2177632

R. Maleh, Improved RIP analysis of orthogonal matching pursuit, 1102.

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.
DOI : 10.1109/TIT.2012.2185923

E. J. Candes and T. Tao, Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.
DOI : 10.1109/TIT.2005.858979

URL : http://arxiv.org/abs/math/0502327

S. Foucart and M. Lai, Sparsest solutions of underdetermined linear systems via <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mi>???</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math>-minimization for <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mn>0</mml:mn><mml:mo><</mml:mo><mml:mi>q</mml:mi><mml:mo>???</mml:mo><mml:mn>1</mml:mn></mml:math>, Applied and Computational Harmonic Analysis, vol.26, issue.3, pp.395-407, 2009.
DOI : 10.1016/j.acha.2008.09.001

M. E. Davies and R. Gribonval, Restricted Isometry Constants Where <formula formulatype="inline"> <tex Notation="TeX">$\ell ^{p}$</tex></formula> Sparse Recovery Can Fail for <formula formulatype="inline"><tex Notation="TeX">$0&#x226A; p \leq 1$</tex></formula>, IEEE Transactions on Information Theory, vol.55, issue.5, pp.2203-2214, 2009.
DOI : 10.1109/TIT.2009.2016030

D. Needell and J. A. Tropp, CoSaMP, Communications of the ACM, vol.53, issue.12, pp.301-321, 2009.
DOI : 10.1145/1859204.1859229

C. Dossal and S. Mallat, Sparse spike deconvolution with minimum scale, Signal Processing with Adaptive Sparse Structured Representations (SPARS workshop), pp.1-4, 2005.

R. Gribonval and M. Nielsen, Beyond sparsity: Recovering structured representations by ${\ell}^1$ minimization and greedy algorithms, Advances in Computational Mathematics, vol.49, issue.6, pp.23-41, 2008.
DOI : 10.1007/s10444-005-9009-5

URL : https://hal.archives-ouvertes.fr/inria-00544767

D. A. Lorenz, S. Schiffler, and D. Trede, Beyond convergence rates: exact recovery with the Tikhonov regularization with sparsity constraints, Inverse Problems, vol.27, issue.8, pp.1-17, 2011.
DOI : 10.1088/0266-5611/27/8/085009

D. L. Donoho, M. Elad, and V. N. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Transactions on Information Theory, vol.52, issue.1, pp.6-18, 2006.
DOI : 10.1109/TIT.2005.860430

T. T. Cai and L. Wang, Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise, IEEE Transactions on Information Theory, vol.57, issue.7, pp.4680-4688, 2011.
DOI : 10.1109/TIT.2011.2146090