H. Attouch, J. Bolte, and B. Svaiter, Convergence of descent methods for semialgebraic and tame problems: proximal algorithms, forwardbackward splitting, and regularized gaussseidel methods, Mathematical Programming, pp.91-129, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00636457

A. Beck and M. Teboulle, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, pp.183-202, 2009.
DOI : 10.1137/080716542

A. Blake and A. Zisserman, Visual reconstruction, 1987.

T. Blumensath, E. Mike, and . Davies, Iterative Thresholding for Sparse Approximations, Journal of Fourier Analysis and Applications, vol.73, issue.10, pp.629-654, 2008.
DOI : 10.1007/s00041-008-9035-z

J. Bolte, A. Daniilidis, A. Lewis, and M. Shiota, Clarke critical values of subanalytic Lipschitz continuous functions, Annales Polonici Mathematici, vol.87, 2005.
DOI : 10.4064/ap87-0-2
URL : http://ddd.uab.cat/record/44142

L. Breiman, Better Subset Regression Using the Nonnegative Garrote, Technometrics, vol.37, issue.4, pp.373-384, 1995.
DOI : 10.1080/01621459.1980.10477428

J. Emmanuel, J. Candès, T. Romberg, and . Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory, vol.52, issue.2, pp.489-509, 2006.

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

. Scott-shaobing-chen, L. David, . Donoho, A. Michael, and . Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1998.
DOI : 10.1137/S1064827596304010

S. Chen, F. Colin, . Cowan, M. Peter, and . Grant, Orthogonal least squares learning algorithm for radial basis function networks, IEEE Transactions on Neural Networks, vol.2, issue.2, pp.302-309, 1991.
DOI : 10.1109/72.80341
URL : http://eprints.soton.ac.uk/251135/1/00080341.pdf

H. Frank and . Clarke, Optimization and nonsmooth analysis, SIAM, vol.5, 1990.

L. Patrick, . Combettes, R. Valérie, and . Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Modeling & Simulation, vol.4, issue.4, pp.1168-1200, 2005.

I. Daubechies, M. Defrise, and C. D. Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on Pure and Applied Mathematics, vol.58, issue.11, pp.1413-1457, 2004.
DOI : 10.1002/cpa.20042

G. Davis, S. Mallat, and M. Avellaneda, Adaptive greedy approximations. Constructive approximation, pp.57-98, 1997.
DOI : 10.1007/bf02678430
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7530

L. David and . Donoho, For most large underdetermined systems of linear equations the minimal ? 1 norm solution is also the sparsest solution, Communications on Pure and Applied Mathematics, vol.59, issue.6, pp.797-829, 2006.

J. Fan and R. Li, Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties, Journal of the American Statistical Association, vol.96, issue.456, pp.1348-1360, 2001.
DOI : 10.1198/016214501753382273

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

G. Fung and O. Mangasarian, Equivalence of Minimal ??? 0- and ??? p -Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p, Journal of Optimization Theory and Applications, vol.22, issue.1, pp.1-10, 2011.
DOI : 10.1007/s10957-011-9871-x

G. Gasso, A. Rakotomamonjy, and S. Canu, Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming, IEEE Transactions on Signal Processing, vol.57, issue.12, pp.4686-4698, 2009.
DOI : 10.1109/TSP.2009.2026004
URL : https://hal.archives-ouvertes.fr/hal-00439453

S. Geman and D. Geman, Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence, issue.6, pp.721-741, 1984.

P. Gong, C. Zhang, Z. Lu, J. Huang, and J. Ye, A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems, Proceedings of The 30th International Conference on Machine Learning, pp.37-45, 2013.

M. Kowalski, Thresholding RULES and iterative shrinkage/thresholding algorithm: A convergence study, 2014 IEEE International Conference on Image Processing (ICIP), 2014.
DOI : 10.1109/ICIP.2014.7025843
URL : https://hal.archives-ouvertes.fr/hal-01102810

L. Hoai-an, H. M. Thi, T. Le, and . Pham-dinh, Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm, Machine Learning, pp.1-24, 2014.

G. Yvan and . Leclerc, Constructing simple stable descriptions for image partitioning, International Journal of Computer Vision, vol.3, issue.1, pp.73-102, 1989.

G. Stéphane, Z. Mallat, and . Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-3415, 1993.

H. Mohimani, M. Babaie-zadeh, I. Gorodnitsky, and C. Jutten, Sparse recovery using smoothed ? 0 (SL0): Convergence analysis. arXiv preprint arXiv:1001, 2010.

H. Mohimani, M. Babaie-zadeh, and C. Jutten, A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed <formula formulatype="inline"><tex Notation="TeX">$\ell ^{0}$</tex></formula> Norm, IEEE Transactions on Signal Processing, vol.57, issue.1, pp.289-301, 2009.
DOI : 10.1109/TSP.2008.2007606

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

M. Nikolova, Markovian reconstruction using a GNC approach, IEEE Transactions on Image Processing, vol.8, issue.9, pp.1204-1220, 1999.
DOI : 10.1109/83.784433

M. Nikolova, Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares, Multiscale Modeling & Simulation, vol.4, issue.3, pp.960-991, 2005.
DOI : 10.1137/040619582

M. Nikolova, Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer, SIAM Journal on Imaging Sciences, vol.6, issue.2, pp.904-937, 2013.
DOI : 10.1137/11085476X

M. Nikolova, Relationship between the optimal solutions of least squares regularized with ? 0 norm and constrained by k-sparsity. hal-00944006v1 Preprint, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00944006

P. Ochs, A. Dosovitskiy, T. Brox, and T. Pock, On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision, SIAM Journal on Imaging Sciences, vol.8, issue.1, pp.331-372, 2015.
DOI : 10.1137/140971518

Y. Chandra-pati, R. Rezaiifar, and P. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, Signals, Systems and Computers Conference Record of The Twenty-Seventh Asilomar Conference on, pp.40-44, 1993.

D. Peleg and R. Meir, A bilinear formulation for vector sparsity optimization, Signal Processing, vol.88, issue.2, pp.375-389, 2008.
DOI : 10.1016/j.sigpro.2007.08.015

C. Marc, A. Robini, I. E. Lachal, and . Magnin, A stochastic continuation approach to piecewise constant reconstruction, IEEE Transactions on Image Processing, vol.16, issue.10, pp.2576-2589, 2007.

C. Marc, . Robini, E. Isabelle, and . Magnin, Optimization by stochastic continuation, SIAM journal on Imaging Sciences, vol.3, issue.4, pp.1096-1121, 2010.

C. Soussen, J. Idier, D. Brie, and J. Duan, From Bernoulli&#x2013;Gaussian Deconvolution to Sparse Signal Restoration, IEEE Transactions on Signal Processing, vol.59, issue.10, pp.4572-4584, 2011.
DOI : 10.1109/TSP.2011.2160633

N. Vladimir and . Temlyakov, Greedy approximation, Acta Numerica, vol.17, pp.235-409, 2008.

A. Joel and . Tropp, Greed is good: Algorithmic results for sparse approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.

C. Zhang, Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, pp.894-942, 2010.
DOI : 10.1214/09-aos729
URL : http://arxiv.org/abs/1002.4734

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