, Nonlinear programming, Athena Scientic, 1999.
, Convex optimization, 2004.
, Statistics for High-Dimensional Data: Methods, Theory and Applications, 2011.
DOI : 10.1007/978-3-642-20192-9
, Sparsity oracle inequalities for the Lasso, Electronic Journal of Statistics, vol.1, issue.0, p.169194, 2007.
DOI : 10.1214/07-EJS008
URL : https://hal.archives-ouvertes.fr/hal-00160646
, Sharp RIP bound for sparse signal and low-rank matrix recovery, Applied and Computational Harmonic Analysis, vol.35, issue.1, p.7493, 2013.
DOI : 10.1016/j.acha.2012.07.010
URL : http://doi.org/10.1016/j.acha.2012.07.010
, The restricted isometry property and its implications for compressed sensing, Comptes Rendus Mathematique, vol.346, issue.9, p.589592, 2008.
, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics, issue.8, p.5912071223, 2006.
, Decoding by linear programming, IEEE Transactions on Information Theory, vol.51, issue.12, p.42034215, 2005.
, Enhancing sparsity by reweighted l 1 minimization, Journal of Fourier Analysis and Applications, vol.14, pp.5-6877905, 2008.
, Exact Reconstruction of Sparse Signals via Nonconvex Minimization, IEEE Signal Processing Letters, vol.14, issue.10, p.707710, 2007.
DOI : 10.1109/LSP.2007.898300
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.154.8478&rep=rep1&type=pdf
, Compressed sensing and best $k$-term approximation, Journal of the American Mathematical Society, vol.22, issue.1, p.211231, 2009.
DOI : 10.1090/S0894-0347-08-00610-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.5477
, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society Series B, vol.39, issue.1, p.138, 1977.
, Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 minimization, Proceedings of the National Academy of Sciences, p.21972202, 2003.
, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Transactions on Information Theory, vol.52, issue.1, p.618, 2006.
, A necessary and sucient condition for exact sparse recovery by l 1 minimization, Comptes Rendus Mathematique, vol.350, issue.1, p.117120, 2012.
DOI : 10.1016/j.crma.2011.12.014
, Sparsest solutions of underdetermined linear systems via l q -minimization for 0 < q ? 1, Applied and Computational Harmonic Analysis, vol.26, issue.3, p.395407, 2009.
, A mathematical introduction to compressive sensing, 2013.
DOI : 10.1007/978-0-8176-4948-7
, Sparse representations in unions of bases, IEEE Transactions on Information Theory, vol.49, issue.12, p.33203325, 2003.
DOI : 10.1109/TIT.2003.820031
URL : https://hal.archives-ouvertes.fr/inria-00071943
, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Applied and Computational Harmonic Analysis, vol.22, issue.3, p.335355, 2007.
DOI : 10.1016/j.acha.2006.09.003
URL : https://hal.archives-ouvertes.fr/inria-00544779
, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition, 2009.
, A tutorial on MM algorithms. The American Statistician, p.3037, 2004.
, On sparse solutions of underdetermined linear systems, Journal of Concrete and Applicable Mathematics, vol.8, issue.2, p.296327, 2010.
, Elementary optimization, p.117, 2004.
DOI : 10.1007/978-1-4614-5838-8_1
, Portfolio optimization with linear and xed transaction costs, Annals of Operations Research, vol.152, issue.1, p.341365, 2007.
, Group bound: confidence intervals for groups of variables in sparse high dimensional regression without assumptions on the design, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.36, issue.5, pp.923-945, 2015.
DOI : 10.1214/07-AOS520
, High-dimensional graphs and variable selection with the lasso. The Annals of Statistics, p.14361462, 2006.
DOI : 10.1214/009053606000000281
URL : http://doi.org/10.1214/009053606000000281
, Boosting as a regularized path to a maximum margin classier, Journal of Machine Learning Research, vol.5, p.941973, 2004.
, Recovery of sparsest signals via l q -minimization, Applied and Computational Harmonic Analysis, vol.32, issue.3, p.329341, 2012.
, Consistent Selection of Tuning Parameters via Variable Selection Stability, Journal of Machine Learning Research, vol.14, p.34193440, 2013.
, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society. Series B (Methodological), vol.58, issue.1, p.267288, 1996.
DOI : 10.1111/j.1467-9868.2011.00771.x
, The lasso problem and uniqueness, Electronic Journal of Statistics, vol.7, p.14561490, 2013.
, The computational complexity of the restricted isometry property , the nullspace property, and related concepts in compressed sensing, IEEE Transactions on Information Theory, vol.60, issue.2, p.12481259, 2014.
, High-dimensional generalized linear models and the lasso. The Annals of Statistics, p.614645, 2008.
, On the conditions used to prove oracle results for the lasso, Electronic Journal of Statistics, vol.3, p.13601392, 2009.
, Compressed sensing recovery via nonconvex shrinkage penalties, Inverse Problems, vol.32, issue.7, p.75004, 2016.
DOI : 10.1088/0266-5611/32/7/075004
URL : http://doi.org/10.1088/0266-5611/32/7/075004
, A Survey of Sparse Representation: Algorithms and Applications, IEEE Access, vol.3, p.490530, 2015.
DOI : 10.1109/ACCESS.2015.2430359
URL : https://hal.archives-ouvertes.fr/hal-01311245
, On model selection consistency of lasso, Journal of Machine Learning Research, vol.7, p.25412563, 2006.
, The Adaptive Lasso and Its Oracle Properties, Journal of the American Statistical Association, vol.101, issue.476, p.14181429, 2006.
DOI : 10.1198/016214506000000735
URL : http://cbio.ensmp.fr/~jvert/svn/bibli/local/Zou2006adaptive.pdf