I. Chapitre and .. Designs-issus-de-graphes-expanseurs-déséquilibrés, 37 1. Preliminaries on Unbalanced Expander Graphs, p.38

.. Deterministic-design, 40 2. Oracle inequalities for the lasso and the Dantzig selector 40 2.1. Error prediction and estimation error for the lasso 41 2.2. Error prediction and estimation error for the Dantzig Selector, 41 3. Results in the Parvaresh-Vardy code framework, p.43

I. Chapitre and .. Relaxation-convexe-sur-l-'espace-des-mesures-signées, 48 2. The generalized dual polynomials 49 2.1. An interpolation problem 49 2.2. Reconstruction of a cone 52 3.1. The homogeneous Markov-systems 52 3.2. The theorem of exact reconstruction, Trigonometric families, p.58

.. The-nullspace-property-for-the-measures, 60 5.1. The spaced out interpolation, p.61

I. Stability-of, 81 4.1. The hypothesis : non-exponential profile, p.81

I. Ambrosio, N. Fusco, and D. Pallara, Free Discontinuity Problems and Special Functions with Bounded Variation, p.185729249002, 2000.
DOI : 10.1007/978-3-0348-8974-2_2

. D. Bcc-+-99-]-c, M. A. Bloomfield, H. Caligiuri, J. R. Coller, M. Downing et al., Molecular classification of cancer : class discovery and class prediction by gene expression monitoring, Science, vol.286, issue.5439, pp.531-537, 1999.

T. [. Borwein and . Erdélyi, Polynomials and polynomial inequalities, Graduate Texts in Mathematics, vol.161, pp.1367960-97, 1995.
DOI : 10.1007/978-1-4612-0793-1

P. Borwein, T. Erdélyi, and J. Zhang, Chebyshev Polynomials and Markov-Bernstein Type Inequalities for Rational Spaces, Journal of the London Mathematical Society, vol.50, issue.3, pp.501-519, 1994.
DOI : 10.1112/jlms/50.3.501

. Bgi-+-08-]-r, A. C. Berinde, P. Gilbert, H. Indyk, M. J. Karloff et al., Combining geometry and combinatorics : A unified approach to sparse signal recovery, Communication, Control, and Computing, 46th Annual Allerton Conference on, pp.798-805, 2008.

P. [. Berinde and . Indyk, Sparse recovery using sparse matrices, Proceedings of the IEEE, pp.937-947, 2010.

P. L. Bartlett, S. Mendelson, and J. Neeman, l1-regularized linear regression : persistence and oracle inequalities, Probability theory and related fields, pp.1-32, 2009.
DOI : 10.1007/s00440-011-0367-2

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

]. S. Bob94 and . Bobkov, An isoperimetric problem on the line, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) Problemy Teorii Veroyatnost. Raspred, vol.21696, issue.13, pp.5-9, 1994.

C. Borell, The Brunn-Minkowski inequality in Gauss space, Inventiones Mathematicae, vol.3, issue.2, pp.207-216, 1975.
DOI : 10.1007/BF01425510

J. Bobin, R. Ottensamer, and J. L. Starck, Compressed sensing in astronomy, Selected Topics in Signal Processing, IEEE Journal, issue.2 5, pp.718-726, 2008.

Y. [. Bickel, A. B. Ritov, and . Tsybakov, Simultaneous analysis of Lasso and Dantzig selector, The Annals of Statistics, vol.37, issue.4, pp.1705-1732, 2009.
DOI : 10.1214/08-AOS620

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

F. Bunea, A. B. Tsybakov, and M. Wegkamp, Sparsity oracle inequalities for the Lasso, Electronic Journal of Statistics, vol.1, issue.0, pp.169-194, 2007.
DOI : 10.1214/07-EJS008

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

L. [. Boyd and . Vandenberghe, Convex optimization, 2004.

P. Bühlmann and S. A. Van-de-geer, On the conditions used to prove oracle results for the Lasso, Electron. J. Stat, vol.3, pp.1360-1392, 2009.

A. Cohen, W. Dahmen, and R. A. Devore, Compressed sensing and best $k$-term approximation, Journal of the American Mathematical Society, vol.22, issue.1, pp.211-231, 2009.
DOI : 10.1090/S0894-0347-08-00610-3

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

D. [. Chen, M. A. Donoho, and . Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput, vol.2099, issue.1, pp.33-61, 1998.
DOI : 10.1137/s003614450037906x

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

A. Cianchi, N. Fusco, F. Maggi, and A. Pratelli, On the isoperimetric deficit in Gauss space, American Journal of Mathematics, vol.133, issue.1, pp.131-186, 2011.
DOI : 10.1353/ajm.2011.0005

B. [. Calderbank, S. Hassibi, W. Jafarpour, and . Xu, Efficient and robust compressed sensing using optimized expander graphs, IEEE Trans. Inform. Theory, vol.55, issue.9, pp.4299-4308, 2009.

]. R. Cot06 and G. B. Cottle, Dantzig : a legendary life in mathematical programming, Math. Program, vol.105, issue.1, pp.1-8, 2006.

Y. [. Candès and . Plan, Near-ideal model selection by ??? 1 minimization, The Annals of Statistics, vol.37, issue.5A, pp.2145-2177, 2009.
DOI : 10.1214/08-AOS653

]. E. Crt06a, J. K. Candès, T. Romberg, and . Tao, Robust uncertainty principles : exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, vol.52, issue.2, pp.489-509, 2006.

V. [. Cirel-son and . Sudakov, Extremal properties of half-spaces for spherically invariant measures, Problems in the theory of probability distributions, II. MR MR0365680, pp.14-2451, 1974.

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

G. B. Dantzig, Linear programming and extensions [dC10] Y. de Castro, Error prediction and variable selection via unbalanced expander graphs, Quantitative isoperimetric inequalities on the real line, pp.311-331, 1998.

]. Y. De-castro and F. Gamboa, Exact reconstruction using support pursuit, 2011.

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

]. R. Dev07 and . Devore, Deterministic constructions of compressed sensing matrices, Journal of Complexity, vol.23, pp.4-6, 2007.

M. [. Donoho, J. M. Lustig, and . Pauly, Sparse mri : The application of compressed sensing for rapid mr imaging, Magnetic Resonance in Medicine, vol.58, issue.6, pp.1182-1195, 2007.

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

P. [. Donoho and . Stark, Uncertainty Principles and Signal Recovery, SIAM Journal on Applied Mathematics, vol.49, issue.3, pp.906-931, 1989.
DOI : 10.1137/0149053

J. [. Donoho and . Tanner, Sparse nonnegative solution of underdetermined linear equations by linear programming, Proceedings of the National Academy of Sciences, vol.102, issue.27, p.9446, 2005.
DOI : 10.1073/pnas.0502269102

]. H. Fed69 and . Federer, Geometric measure theory, Die Grundlehren der mathematischen Wissenschaften, pp.257325-257366, 1969.

F. [. Fusco, A. Maggi, and . Pratelli, The sharp quantitative isoperimetric inequality, Annals of Mathematics, vol.168, issue.3, pp.941-980, 2008.
DOI : 10.4007/annals.2008.168.941

E. [. Gamboa and . Gassiat, Sets of Superresolution and the Maximum Entropy Method on the Mean, SIAM Journal on Mathematical Analysis, vol.27, issue.4, p.1129, 1996.
DOI : 10.1137/S0036141092233202

V. Guruswami, J. R. Lee, and A. Razborov, Almost euclidean subspaces of _1 via expander codes, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp.353-362, 2008.

V. Guruswami, C. Umans, and S. Vadhan, Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes, J. ACM, vol.56, issue.4, pp.34-2590822, 1920.
DOI : 10.1109/ccc.2007.38

URL : http://authors.library.caltech.edu/15105/1/Guruswami2009p5602J_Acm.pdf

A. C. Hansen, Generalized sampling and infinite dimensional compressed sensing, 2011.

G. Hennenfent, F. J. Herrmann, and C. Sastry, Signal reconstruction from incomplete and misplaced measurements, EAGE 69th Conference & Exhibition, European Association of Geoscientists & Engineers, 2007.

Z. He, W. J. Studden, and D. Sun, Optimal designs for rational models Further results on performance analysis for compressive sensing analysis for compressive sensing using expander graphs, Conf. Rec. 41st Asilomar Conf. Signals, Systems and Computers, pp.2128-2147, 1996.

]. P. Ind07 and . Indyk, Uncertainty principles, extractors, and explicit embeddings of _2 into _1, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp.615-620, 2007.

S. [. Indyk and . Szarek, Almost-euclidean subspaces of _1 via tensor products : A simple approach to randomness reduction, Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, pp.632-641, 2010.

A. [. Juditsky and . Nemirovski, On verifiable sufficient conditions for sparse signal recovery via _1 minimization, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00321775

]. N. Kar84 and . Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.486, issue.4, pp.373-395, 1984.

]. B. Kas77 and . Kashin, The widths of certain finite-dimensional sets and classes of smooth functions, Izv. Akad. Nauk SSSR Ser. Mat, vol.41, issue.2, pp.334-351, 1977.

A. [. Kre?-in and . Nudel-man, The Markov moment problem and extremal problems, Providence, R.I, 1977.

W. [. Karlin and . Studden, Tchebycheff systems : With applications in analysis and statistics, Pure and Applied Mathematics, vol.XV, pp.204922-204956, 1966.

A. [. Kuhn and . Tucker, Nonlinear programming, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pp.481-492, 1950.

V. [. Kashin and . Temlyakov, A Remark on Compressed Sensing, Matematicheskie Zametki, vol.82, issue.6, pp.829-837, 2007.
DOI : 10.4213/mzm4183

K. G. Murty, Linear programming, George B. Dantzig. MR, vol.86, p.72054790083, 1983.

A. [. Parvaresh and . Vardy, Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.285-294, 2005.
DOI : 10.1109/SFCS.2005.29

]. T. Riv90, C. Rivlin, and . Polynomials, From approximation theory to algebra and number theory, Pure and Applied Mathematics, p.106073541016, 1990.

R. [. Rudelson and . Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Communications on Pure and Applied Mathematics, vol.52, issue.8, pp.1025-1045, 2008.
DOI : 10.1002/cpa.20227

]. R. Tib96 and . Tibshirani, Regression shrinkage and selection via the lasso, J. Roy. Statist. Soc. Ser. B, vol.5896, issue.1, pp.267-288, 1996.

. [. ?idák, On multivariate normal probabilities of rectangles : Their dependence on correlations, Ann. Math. Statist, vol.39, pp.1425-1434, 1968.

P. [. Yu and . Zhao, On model selection consistency of Lasso, J. Mach. Learn. Res, vol.7, pp.2541-2563, 2006.