D. L. Donoho, De-noising by soft-thresholding, IEEE Transactions on Information Theory, vol.41, issue.3, pp.613-627, 1995.
DOI : 10.1109/18.382009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.9704

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.

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

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

C. H. Zhang, Nearly unbiased variable selection under minimax concave penalty, The Annals of Statistics, vol.38, issue.2, pp.894-942, 2010.
DOI : 10.1214/09-AOS729

E. J. Candes, M. B. Wakin, and S. P. Boyd, Enhancing Sparsity by Reweighted ??? 1 Minimization, Journal of Fourier Analysis and Applications, vol.7, issue.3, pp.5-6, 2008.
DOI : 10.1007/s00041-008-9045-x

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 (ICML), pp.37-45, 2013.

L. T. An and P. D. Tao, The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems, Annals of Operations Research, vol.6, issue.1, pp.23-46, 2005.
DOI : 10.1007/s10479-004-5022-1

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

Z. Lu, Sequential convex programming methods for a class of structured nonlinear programming, 2012.

J. Cheng, C. Hatzis, H. Hayashi, M. Krogel, S. Morishita et al., KDD Cup 2001 report, ACM SIGKDD Explorations Newsletter, vol.3, issue.2, pp.47-64, 2001.
DOI : 10.1145/507515.507523

M. Thiao, Approches de la programmation DC et DCA en data mining: modélisation parcimonieuse de données, 13] S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

D. G. Luenberger, Linear and nonlinear programming, 2003.
DOI : 10.1007/978-3-319-18842-3

H. Zou and R. Li, One-step sparse estimates in nonconcave penalized likelihood models, The Annals of Statistics, vol.36, issue.4, p.1509, 2008.
DOI : 10.1214/009053607000000802

S. Sra, Nonconvex proximal splitting: batch and incremental algorithms Arxiv preprint, 2011.

J. Ma, L. K. Saul, S. Savage, and G. M. Voelker, Identifying suspicious URLs, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.681-688, 2009.
DOI : 10.1145/1553374.1553462

I. Guyon, S. Gunn, A. Ben-hur, and G. Dror, Result analysis of the NIPS 2003 feature selection challenge, Advances in Neural Information Processing Systems, pp.545-552, 2004.

V. Krylov, G. Moser, S. B. Serpico, and J. Zerubia, Supervised High-Resolution Dual-Polarization SAR Image Classification by Finite Mixtures and Copulas, IEEE Journal of Selected Topics in Signal Processing, vol.5, issue.3, pp.554-566, 2011.
DOI : 10.1109/JSTSP.2010.2103925
URL : https://hal.archives-ouvertes.fr/inria-00562326

D. Tuia, R. Flamary, M. Volpi, M. D. Mura, and A. Rakotomamonjy, Discovering relevant spatial filterbanks for VHR image classification, International Conference on Pattern Recognition (ICPR), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00798589