A. Barvinok, Math 710: Measure concentration, Lecture notes, 2005.

S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

M. Chiani, D. Dardari, and M. K. Simon, New exponential bounds and approximations for the computation of error probability in fading channels, IEEE Transactions on Wireless Communications, vol.24, issue.5, pp.840-845, 2003.
DOI : 10.1109/TWC.2003.814350

. G. Chkk-]-p, A. Casazza, F. Heinecke, G. Krahmer, and . Kutyniok, Optimally Sparse Frames, IEEE Trans. Inf. Theory, vol.57, issue.11, pp.7279-7287

M. [. Dokmani´cdokmani´c, M. Kolund?ija, and . Vetterli, Beyond Moore-Penrose: Sparse pseudoinverse, IEEE ICASSP. IEEE, pp.6526-6530, 2013.

S. [. Davis, M. Mallat, and . Avellaneda, Adaptive greedy approximations, Constructive Approximation, vol.21, issue.1, pp.57-98, 1997.
DOI : 10.1007/BFb0112501
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7530

]. D. Don06 and . Donoho, Compressed Sensing, IEEE Trans. Inf. Theory, vol.52, issue.4, pp.1289-1306, 2006.

]. C. Dos12 and . Dossal, A necessary and sufficient condition for exact sparse recovery by minimization, Comptes Rendus Mathematique, vol.350, issue.12, pp.117-120, 2012.

M. Elad, Sparse and Redundant Representations, ser. From Theory to Applications in Signal and Image Processing, 2010.
DOI : 10.1007/978-1-4419-7011-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.8963

J. 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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1728

N. Halko, P. G. Martinsson, and J. A. Tropp, Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions, SIAM Review, vol.53, issue.2, pp.217-288, 2011.
DOI : 10.1137/090771806
URL : http://arxiv.org/abs/0909.4061

F. Krahmer, G. Kutyniok, and J. Lemvig, Sparsity and spectral properties of dual frames, Linear Algebra and its Applications, vol.439, issue.4, pp.1-17, 2012.
DOI : 10.1016/j.laa.2012.10.016
URL : http://arxiv.org/abs/1204.5062

M. Ledoux, Concentration of measure and logarithmic Sobolev inequalities, Séminaire de Probabilités XXXIII, pp.120-216, 1999.
DOI : 10.1007/s004400050137
URL : http://www.numdam.org/article/SPS_1999__33__120_0.pdf

Y. [. Li, T. Liu, and . Mi, Sparse Dual Frames and Dual Gabor Functions of Minimal Time and Frequency Supports, Journal of Fourier Analysis and Applications, vol.21, issue.3, pp.48-76, 2013.
DOI : 10.1016/0165-1684(90)90087-F

]. B. Nat95 and . Natarajan, Sparse approximate solutions to linear systems, SIAM J. Computing, vol.25, issue.2, pp.227-234, 1995.

S. Oymak, C. Thrampoulidis, and B. Hassibi, The squared-error of generalized LASSO: A precise analysis, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2013.
DOI : 10.1109/Allerton.2013.6736635

N. [. Perraudin, P. L. Holighaus, P. Søndergaard, and . Balazs, Designing Gabor Windows Using Convex Optimization, 2014.

M. Rudelson, Invertibility of random matrices: norm of the inverse, Annals of Mathematics, vol.168, issue.2, pp.575-600, 2008.
DOI : 10.4007/annals.2008.168.575

M. Sion, On general minimax theorems, Pacific Journal of Mathematics, vol.8, issue.1, pp.171-176, 1958.
DOI : 10.2140/pjm.1958.8.171

E. [. Thrampoulidis, B. Abbasi, and . Hassibi, Precise Error Analysis of Regularized M-estimators in High-dimensions, 2016.

]. R. Tib13 and . Tibshirani, The lasso problem and uniqueness, Electronic Journal of Statistics, vol.7, issue.0, pp.1456-1490, 2013.

S. [. Thrampoulidis and . Oymak, Regularized linear regression: A precise analysis of the estimation error, Proceedings of The 28th, 2015.

]. R. Ver09 and . Vershynin, Introduction to the non-asymptotic analysis of random matrices, pp.210-268, 2009.

M. Wainwright and J. G. , Available: https://www Note on the Gamma Function, Am. Math. Mon, vol.55, issue.9, p.563, 1948.