H. Attouch, J. Bolte, and B. F. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Mathematical Programming, vol.137, issue.1, pp.91-129, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00790042

A. Beck and Y. Eldar, Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms, SIAM Journal on Optimization, vol.23, issue.3, pp.1480-1509, 2013.

A. Beck and N. Hallak, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms. Mathematics of Operations Research, vol.41, pp.196-223, 2016.

A. Beck and N. Hallak, Proximal Mapping for Symmetric Penalty and Sparsity, SIAM Journal on Optimization, vol.28, issue.1, pp.496-527, 2018.

T. Blumensath and M. E. Davies, Iterative hard thresholding for compressed sensing, vol.27, pp.265-274, 2009.

S. Bourguignon, J. Ninin, H. Carfantan, and M. Mongeau, Exact Sparse Approximation Problems via MixedInteger Programming: Formulations and Computational Performance, IEEE Transactions on Signal Processing, vol.64, issue.6, pp.1405-1419, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01254856

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

E. J. Candes, J. Romberg, and T. 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.

E. J. Candès, M. B. Wakin, and S. P. Boyd, Enhancing Sparsity by Reweighted 1 Minimization, Journal of Fourier Analysis and Applications, vol.14, issue.5, pp.877-905, 2008.

M. Carlsson, D. Gerosa, and C. Olsson, An unbiased approach to compressed sensing, 2018.

M. Carlsson, On Convex Envelopes and Regularization of Non-convex Functionals Without Moving Global Minima, Journal of Optimization Theory and Applications, vol.183, issue.1, pp.66-84, 2019.

S. Chen, C. F. Cowan, and P. M. Grant, Orthogonal least squares learning algorithm for radial basis function networks, IEEE Transactions on Neural Networks, vol.2, issue.2, pp.302-309, 1991.

E. Chouzenoux, A. Jezierska, J. Pesquet, and H. Talbot, A Majorize-Minimize Subspace Approach for 2 ? 0 Image Regularization, SIAM Journal on Imaging Sciences, vol.6, issue.1, pp.563-591, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00789962

W. Dai and O. Milenkovic, Subspace Pursuit for Compressive Sensing Signal Reconstruction, IEEE Transactions on Information Theory, vol.55, issue.5, pp.2230-2249, 2009.

D. L. 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.

S. Durand and M. Nikolova, Stability of the Minimizers of Least Squares with a Non-Convex Regularization, Part I: Local Behavior. Applied Mathematics and Optimization, vol.53, issue.2, pp.185-208, 2006.

S. Durand and M. Nikolova, Stability of the Minimizers of Least Squares with a Non-Convex Regularization, Part II: Global Behavior. Applied Mathematics and Optimization, vol.53, issue.3, pp.259-277, 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.

S. Foucart, Hard Thresholding Pursuit: An Algorithm for Compressive Sensing, SIAM Journal on Numerical Analysis, vol.49, issue.6, pp.2543-2563, 2011.

S. Foucart and M. Lai, Sparsest solutions of underdetermined linear systems via q -minimization for 0<q ? 1. Applied and Computational Harmonic Analysis, vol.26, pp.395-407, 2009.

D. Geman and G. Reynolds, Constrained restoration and the recovery of discontinuities, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.14, issue.3, pp.367-383, 1992.

I. F. Gorodnitsky and B. D. Rao, Sparse signal reconstruction from limited data using FOCUSS: A reweighted minimum norm algorithm, IEEE Transactions on Signal Processing, pp.600-616, 1997.

C. Herzet and A. Drémeau, Bayesian pursuit algorithms, 18th European Signal Processing Conference, pp.1474-1478, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00539109

P. Jain, A. Tewari, and I. S. Dhillon, Orthogonal Matching Pursuit with Replacement, Advances in Neural Information Processing Systems, vol.24, pp.1215-1223, 2011.

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

A. Marmin, M. Castella, and J. Pesquet, How to Globally Solve Non-convex Optimization Problems Involving an Approximate 0 Penalization, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.5601-5605, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02196878

D. Needell and J. A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Applied and Computational Harmonic Analysis, vol.26, issue.3, pp.301-321, 2009.

T. T. Nguyen, C. Soussen, J. Idier, and E. , Djermoune. NP-hardness of 0 minimization problems: revision and extension to the non-negative setting, International Conference on Sampling Theory and Applications (SampTa), 2019.

M. Nikolova, Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized LeastSquares, Multiscale Modeling & Simulation, vol.4, issue.3, pp.960-991, 2005.

M. Nikolova, Bounds on the Minimizers of (nonconvex) Regularized Least-Squares, Scale Space and Variational Methods in Computer Vision, pp.496-507, 2007.

M. Nikolova, Solve exactly an under determined linear system by minimizing least squares regularized with an 0 penalty, Comptes Rendus Mathematique, vol.349, issue.21, pp.1145-1150, 2011.

M. Nikolova, Description of the Minimizers of Least Squares Regularized with 0 -norm. Uniqueness of the Global Minimizer, SIAM Journal on Imaging Sciences, vol.6, issue.2, pp.904-937, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00723812

M. Nikolova, Relationship between the optimal solutions of least squares regularized with 0 -norm and constrained by k-sparsity. Applied and Computational Harmonic, Analysis, vol.41, issue.1, pp.237-265, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00944006

M. Nikolova and M. Ng, Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery, SIAM Journal on Scientific Computing, vol.27, issue.3, pp.937-966, 2005.

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.

Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, vol.1, pp.40-44, 1993.

M. Pilanci, M. J. Wainwright, and L. E. Ghaoui, Sparse learning via Boolean relaxations, Mathematical Programming, vol.151, issue.1, pp.63-87, 2015.

A. Repetti, M. Q. Pham, L. Duval, J. Chouzenoux, and . Pesquet, Euclid in a Taxicab: Sparse Blind Deconvolution with Smoothed 1 / 2 Regularization, IEEE Signal Processing Letters, vol.22, issue.5, pp.539-543, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01328398

I. Selesnick, Sparse Regularization via Convex Analysis, IEEE Transactions on Signal Processing, vol.65, issue.17, pp.4481-4494, 2017.

I. Selesnick and M. Farshchian, Sparse Signal Approximation via Nonseparable Regularization, IEEE Transactions on Signal Processing, vol.65, issue.10, pp.2561-2575, 2017.

E. Soubies, L. Blanc-féraud, and G. Aubert, A Continuous Exact 0 Penalty (CEL0) for Least Squares Regularized Problem, SIAM Journal on Imaging Sciences, vol.8, issue.3, pp.1607-1639, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01102492

E. Soubies, L. Blanc-féraud, and G. Aubert, A Unified View of Exact Continuous Penalties for 2 -0 Minimization, SIAM Journal on Optimization, vol.27, issue.3, pp.2034-2060, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01267701

C. Soussen, J. Idier, D. Brie, and J. Duan, From Bernoulli-Gaussian Deconvolution to Sparse Signal Restoration, IEEE Transactions on Signal Processing, vol.59, issue.10, pp.4572-4584, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00443842

C. Soussen, J. Idier, J. Duan, and D. Brie, Homotopy Based Algorithms for 0 -Regularized Least-Squares, IEEE Transactions on Signal Processing, vol.63, issue.13, pp.3301-3316, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00948313

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

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

J. A. Tropp, Just relax: convex programming methods for identifying sparse signals in noise, IEEE Transactions on Information Theory, vol.52, issue.3, pp.1030-1051, 2006.

F. Wen, L. Chu, P. Liu, and R. C. Qiu, A Survey on Nonconvex Regularization-Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning, IEEE Access, vol.6, pp.69883-69906, 2018.

C. Zhang, Nearly unbiased variable selection under minimax concave penalty. The Annals of Statistics, vol.38, pp.894-942, 2010.

N. Zhang and Q. Li, On optimal solutions of the constrained 0 regularization and its penalty problem, verse Problems, vol.33, p.25010, 2017.

T. Zhang, Multi-stage Convex Relaxation for Learning with Sparse Regularization, Advances in Neural Information Processing Systems 21, pp.1929-1936, 2009.

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