R. Baraniuk and P. Steeghs, Compressive Radar Imaging, 2007 IEEE Radar Conference, pp.128-133, 2007.
DOI : 10.1109/RADAR.2007.374203

P. Dimitri and . Bertsekas, Nonlinear programming, Athena Scientific, 1999.

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

P. Bühlmann and S. Van-de-geer, Statistics for High-Dimensional Data: Methods, Theory and Applications, 2011.
DOI : 10.1007/978-3-642-20192-9

F. Bunea, A. 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

M. Burger, C. Rossmanith, and X. Zhang, Simultaneous reconstruction and segmentation for dynamic SPECT imaging, Inverse Problems, vol.32, issue.10, p.104002, 2016.
DOI : 10.1088/0266-5611/32/10/104002
URL : http://arxiv.org/pdf/1606.03852

T. Cai and A. Zhang, Sharp RIP bound for sparse signal and low-rank matrix recovery, Applied and Computational Harmonic Analysis, vol.35, issue.1, pp.74-93, 2013.
DOI : 10.1016/j.acha.2012.07.010
URL : https://doi.org/10.1016/j.acha.2012.07.010

J. Emmanuel and . Candes, The restricted isometry property and its implications for compressed sensing, Comptes Rendus Mathematique, vol.346, issue.9, pp.589-592, 2008.

J. Emmanuel, . Candes, K. Justin, T. Romberg, and . Tao, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics, vol.59, issue.8, pp.1207-1223, 2006.

J. Emmanuel, T. Candes, and . Tao, Decoding by linear programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.

J. Emmanuel, . Candes, B. Michael, . Wakin, P. Stephen et al., Enhancing sparsity by reweighted l 1 minimization, Journal of Fourier Analysis and Applications, vol.14, pp.5-6877, 2008.

R. Chartrand, Exact Reconstruction of Sparse Signals via Nonconvex Minimization, IEEE Signal Processing Letters, vol.14, issue.10, pp.707-710, 2007.
DOI : 10.1109/LSP.2007.898300

A. Cohen, W. Dahmen, and R. 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://www.igpm.rwth-aachen.de/Download/reports/pdf/IGPM260.pdf

P. Arthur, . Dempster, M. Nan, . Laird, B. Donald et al., Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society Series B, vol.39, issue.1, pp.1-38, 1977.

L. David, M. Donoho, and . Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 minimization, Proceedings of the National Academy of Sciences, pp.2197-2202, 2003.

L. David, M. Donoho, . Elad, N. Vladimir, and . 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.

C. Dossal, A necessary and sufficient condition for exact sparse recovery by minimization, Comptes Rendus Mathematique, vol.350, issue.1-2, pp.117-120, 2012.
DOI : 10.1016/j.crma.2011.12.014

H. Joachim and . Ender, On compressive sensing applied to radar, Signal Processing, vol.90, issue.5, pp.1402-1414, 2010.

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

S. Foucart and H. Rauhut, A mathematical introduction to compressive sensing, 2013.
DOI : 10.1007/978-0-8176-4948-7

R. Gribonval and M. Nielsen, Sparse representations in unions of bases, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3320-3325, 2003.
DOI : 10.1109/TIT.2003.820031
URL : https://hal.archives-ouvertes.fr/inria-00071943

R. Gribonval and M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Applied and Computational Harmonic Analysis, vol.22, issue.3, pp.335-355, 2007.
DOI : 10.1016/j.acha.2006.09.003
URL : https://hal.archives-ouvertes.fr/inria-00564038

C. Ali, . Gurbuz, H. James, W. Mcclellan, and . Jr, Compressive sensing for subsurface imaging using ground penetrating radar, Signal Processing, vol.89, issue.10, pp.1959-1972, 2009.

T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition, 2009.

J. Haupt, U. Waheed, G. Bajwa, R. Raz, and . Nowak, Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation, IEEE Transactions on Information Theory, vol.56, issue.11, pp.5862-5875, 2010.
DOI : 10.1109/TIT.2010.2070191
URL : http://www.rci.rutgers.edu/~wub1/pubs/tit10_toep_matrices.pdf

A. Matthew, T. Herman, and . Strohmer, High-resolution radar via compressed sensing, IEEE transactions on signal processing, vol.57, issue.6, pp.2275-2284, 2009.

R. David, K. Hunter, and . Lange, A tutorial on MM algorithms. The American Statistician, pp.30-37, 2004.

M. Lai, On sparse solutions of underdetermined linear systems, Journal of Concrete and Applicable Mathematics, vol.8, issue.2, pp.296-327, 2010.

K. Lange, Elementary optimization, Optimization, pp.1-17, 2004.
DOI : 10.1007/978-1-4614-5838-8_1

J. Liu and H. Gao, Material reconstruction for spectral computed tomography with detector response function, Inverse Problems, vol.32, issue.11, p.114001, 2016.
DOI : 10.1088/0266-5611/32/11/114001

M. Sousa-lobo, M. Fazel, and S. Boyd, Portfolio optimization with linear and fixed transaction costs, Annals of Operations Research, vol.38, issue.1, pp.341-365, 2007.
DOI : 10.1016/S0022-0000(76)80021-9

N. Meinshausen, 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

N. Meinshausen and P. Bühlmann, High-dimensional graphs and variable selection with the lasso. The Annals of Statistics, pp.1436-1462, 2006.

K. Prieto and O. Dorn, Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D, Inverse Problems, vol.33, issue.1, p.14001, 2016.
DOI : 10.1088/0266-5611/33/1/014001

H. Rauhut, Compressive sensing and structured random matrices. Theoretical foundations and numerical methods for sparse recovery, pp.1-92, 2010.

J. Romberg, Compressive Sensing by Random Convolution, SIAM Journal on Imaging Sciences, vol.2, issue.4, pp.1098-1128, 2009.
DOI : 10.1137/08072975X
URL : http://dsp.rice.edu/files/cs/RandomConvolution.pdf

S. Rosset, J. Zhu, and T. Hastie, Boosting as a regularized path to a maximum margin classifier, Journal of Machine Learning Research, vol.5, pp.941-973, 2004.

Q. Sun, Recovery of sparsest signals 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:msup><mml:mi>???</mml:mi><mml:mi>q</mml:mi></mml:msup></mml:math>-minimization, Applied and Computational Harmonic Analysis, vol.32, issue.3, pp.329-341, 2012.
DOI : 10.1016/j.acha.2011.07.001

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.1467-9868.2011.00771.x

J. Ryan and . Tibshirani, The lasso problem and uniqueness, Electronic Journal of Statistics, vol.7, pp.1456-1490, 2013.

M. Andreas, . Tillmann, E. Marc, and . Pfetsch, 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, pp.1248-1259, 2014.

A. Sara and . Van-de-geer, High-dimensional generalized linear models and the lasso, The Annals of Statistics, vol.36, issue.2, pp.614-645, 2008.

A. Sara, . Van-de, P. Geer, and . Bühlmann, On the conditions used to prove oracle results for the lasso, Electronic Journal of Statistics, vol.3, pp.1360-1392, 2009.

J. Woodworth and R. Chartrand, 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://iopscience.iop.org/article/10.1088/0266-5611/32/7/075004/pdf

Z. Xu, X. Chang, F. Xu, and H. Zhang, L 1/2 regularization, IEEE Transactions on neural networks and learning systems, pp.1013-1027, 2012.
DOI : 10.1007/s11432-010-0090-0

Z. Zhang, Y. Xu, J. Yang, X. Li, and D. Zhang, A Survey of Sparse Representation: Algorithms and Applications, IEEE Access, vol.3, pp.490-530, 2015.
DOI : 10.1109/ACCESS.2015.2430359
URL : https://hal.archives-ouvertes.fr/hal-01311245

P. Zhao and B. Yu, On model selection consistency of lasso, Journal of Machine Learning Research, vol.7, pp.2541-2563, 2006.

H. Zou, The Adaptive Lasso and Its Oracle Properties, Journal of the American Statistical Association, vol.101, issue.476, pp.1418-1429, 2006.
DOI : 10.1198/016214506000000735