L. Hoai-minh, N. Thi-bich-thuy, T. M. Thuy, L. T. , and H. An, Image Segmentation via Feature Weighted Fuzzy Clustering by a DCA based algorithm, Advanced Computational Methods for Knowledge Engineering, Studies in Computational Intelligence, Print) 1860?9503 (Online) The 1-th International Conference on Computer Science, Applied Mathematics and Applications, pp.1860-949, 2013.

L. T. , H. An, L. M. Tam, and N. Thuy, A novel approach to automated cell counting based on a Difference of Convex functions Algorithm (DCA), Computational Collective Intelligence. Technologies and Applications, The 5-th International Conference on Computational Collective Intelligence, Technologies and Applications, pp.336-345, 2013.

M. Aharon, M. Elad, and A. Bruckstein, $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation, IEEE Transactions on Signal Processing, vol.54, issue.11, pp.4311-4322, 2006.
DOI : 10.1109/TSP.2006.881199

D. Anoraganingrum, Cell segmentation with median filter and mathematical morphology operation, Proceedings 10th International Conference on Image Analysis and Processing, pp.1043-1046, 1999.
DOI : 10.1109/ICIAP.1999.797734

H. Attouch, J. Bolte, P. Redont, and A. Soubeyran, Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-??ojasiewicz Inequality, Mathematics of Operations Research, vol.35, issue.2, pp.438-457, 2010.
DOI : 10.1287/moor.1100.0449

A. Auslender, Optimisation: méthodes numériques. Ma??triseMa??trise de mathématiques et applications fondamentales, 1976.

H. H. Bauschke and P. L. Combettes, Convex analysis and monotone operator theory in hilbert spaces, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01517477

S. Belongie, C. Carson, H. Greenspan, and J. Malik, Color- and texture-based image segmentation using EM and its application to content-based image retrieval, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271), p.675, 1998.
DOI : 10.1109/ICCV.1998.710790

C. James and . Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, 1981.

J. Bolte, S. Sabach, and M. Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming, vol.4, issue.1-2, pp.459-494, 2014.
DOI : 10.1007/BF01584660

URL : https://hal.archives-ouvertes.fr/hal-00916090

M. Borsotti, P. Campadelli, and R. Schettini, Quantitative evaluation of color image segmentation results, Pattern Recognition Letters, vol.19, issue.8, pp.741-747, 1998.
DOI : 10.1016/S0167-8655(98)00052-X

S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Machine Learning, pp.1-122, 2011.
DOI : 10.1561/2200000016

S. Paul, O. L. Bradley, and . Mangasarian, Feature selection via concave minimization and support vector machines, ICML, pp.82-90, 1998.

M. Brand, A short note on local region growing by pseudophysical simulation, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp.15-17, 1993.
DOI : 10.1109/CVPR.1993.341173

L. Busin, N. Vandenbroucke, and L. Macaire, Color spaces and image segmentation Advances in Imaging and Electron Physics, pp.65-168, 2005.

P. Campadelli, D. Medici, and R. Schettini, Color image segmentation using Hopfield networks, Image and Vision Computing, vol.15, issue.3, pp.161-166, 1997.
DOI : 10.1016/S0262-8856(96)01121-3

E. J. Candes and P. A. Randall, Highly Robust Error Correction byConvex Programming, IEEE Transactions on Information Theory, vol.54, issue.7, pp.2829-2840, 2008.
DOI : 10.1109/TIT.2008.924688

E. J. Candes and T. Tao, Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.
DOI : 10.1109/TIT.2005.858979

URL : https://authors.library.caltech.edu/1378/1/CANieeetit05.pdf

E. J. Candes and T. Tao, The Dantzig selector: Statistical estimation when p is much larger than n. The Annals of Statistics, pp.2313-2351, 2007.

E. J. Candes, J. K. 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.
DOI : 10.1109/TIT.2005.862083

URL : http://www.ee.duke.edu/~lcarin/01580791.pdf

E. J. Candes, J. K. Romberg, and T. Tao, Stable signal recovery from incomplete and inaccurate measurements, Communications on Pure and Applied Mathematics, vol.7, issue.8, pp.1207-1223, 2006.
DOI : 10.1017/CBO9780511804441

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.877-905, 2008.
DOI : 10.1007/978-1-4757-4182-7

E. J. Candes and T. Tao, Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5406-5425, 2006.
DOI : 10.1109/TIT.2006.885507

E. Y. Chan, W. Ching, M. K. Ng, and J. Z. Huang, An optimization algorithm for clustering using weighted dissimilarity measures, Pattern Recognition, vol.37, issue.5, pp.943-952, 2004.
DOI : 10.1016/j.patcog.2003.11.003

M. Chapron, A new chromatic edge detector used for color image segmentation, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,, pp.311-314, 1992.
DOI : 10.1109/ICPR.1992.201987

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

R. Chartrand and W. Yin, Iteratively reweighted algorithms for compressive sensing, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008.
DOI : 10.1109/ICASSP.2008.4518498

S. S. Chen, D. Donoho, and M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.33-61, 1998.
DOI : 10.1137/S1064827596304010

H. D. Cheng, X. H. Jiang, and J. Wang, Color image segmentation based on homogram thresholding and region merging, Pattern Recognition, vol.35, issue.2, pp.373-393, 2002.
DOI : 10.1016/S0031-3203(01)00054-1

O. , C. Soon, and H. A. Le-thi, Learning sparse classifiers with difference of convex functions algorithms. Optimization Methods and Software, pp.830-854, 2013.

P. Combettes and J. Pesquet, Proximal splitting methods in signal processing. Fixed-Point Algorithms for, Inverse Problems in Science and Engineering, vol.20, issue.3, pp.185-212, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643807

A. Cumani, Edge detection in multispectral images In Computer Vision, Graphic and Image Processing: Graphical Models and Image Processing, pp.40-51, 1989.

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.
DOI : 10.1109/TIT.2009.2016006

W. Dai, T. Xu, and W. Wang, Dictionary learning and update based on simultaneous codeword optimization (SimCO), 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.6340-6353, 2012.
DOI : 10.1109/ICASSP.2012.6288309

I. Damnjanovic, M. E. Davies, and M. D. Plumbley, SMALLbox - An Evaluation Framework for Sparse Representations and Dictionary Learning Algorithms, Proc. LVA/ICA'10, pp.418-425, 2010.
DOI : 10.1007/978-3-642-15995-4_52

URL : https://hal.archives-ouvertes.fr/inria-00574155

G. Dantzig, Linear programming and extensions, 1963.
DOI : 10.1515/9781400884179

I. Daubechies, R. Devore, M. Fornasier, and C. Güntük, Iteratively reweighted least squares minimization for sparse recovery, Communications on Pure and Applied Mathematics, vol.58, issue.1, pp.1-38, 2010.
DOI : 10.1109/ICASSP.2008.4518498

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.50, issue.6, pp.797-829, 2006.
DOI : 10.1017/CBO9780511662454

D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1289-1306, 2006.
DOI : 10.1109/TIT.2006.871582

URL : https://hal.archives-ouvertes.fr/inria-00369486

D. L. Donoho and M. Elad, Optimally sparse representation in general (non-orthogonal) dictionaries via ell1 minimization, Proc. Natl Acad. Sci. USA, pp.2197-202, 2003.

D. L. Donoho and X. Huo, Uncertainty principles and ideal atomic decomposition, IEEE Transactions on Information Theory, vol.47, issue.7, pp.2845-2862, 2001.
DOI : 10.1109/18.959265

D. L. Donoho and B. F. Logan, Signal Recovery and the Large Sieve, SIAM Journal on Applied Mathematics, vol.52, issue.2, pp.577-591, 1992.
DOI : 10.1137/0152031

D. L. Donoho, Y. Tsaig, I. Drori, and J. Starck, Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.2, 2006.
DOI : 10.1109/TIT.2011.2173241

M. Elad and M. Aharon, Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries, IEEE Transactions on Image Processing, vol.15, issue.12, pp.3736-3745, 2006.
DOI : 10.1109/TIP.2006.881969

K. Engan, B. D. Rao, and K. Kreutz-delgado, Frame design using focuss with method of optimal directions (mod), Proc. Norwegian Signal Processing Symposium, pp.65-69, 1999.

K. Engan, S. O. Aase, and H. J. Husoy, Method of optimal directions for frame design, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), pp.2443-2446, 1999.
DOI : 10.1109/ICASSP.1999.760624

K. Engan, K. Skretting, and J. H. Husoy, Family of iterative LS-based dictionary learning algorithms, ILS-DLA, for sparse signal representation, Digital Signal Processing, vol.17, issue.1, pp.32-49, 1051.
DOI : 10.1016/j.dsp.2006.02.002

E. Esser, Y. Lou, and J. Xin, A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications, SIAM Journal on Imaging Sciences, vol.6, issue.4, pp.2010-2046, 2013.
DOI : 10.1137/13090540X

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, 2001.
DOI : 10.1198/016214501753382273

A. Fawzi, M. Davies, and P. Frossard, Dictionary learning for fast classification based on soft-thresholding. arXiv:1402, 2014.

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

H. Frigui and O. Nasui, Unsupervised learning of prototypes and attribute weights, Pattern Recognition, vol.37, issue.3, pp.567-581, 2004.
DOI : 10.1016/j.patcog.2003.08.002

W. J. Fu, Penalized regressions: The bridge versus the lasso, Journal of Computational and Graphical Statistics, vol.7, pp.397-416, 1998.

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 Trans. Pattern Anal. Mach. Intell, vol.6, issue.6, pp.721-741, 1984.

T. Goldstein and S. Osher, The Split Bregman Method for L1-Regularized Problems, SIAM Journal on Imaging Sciences, vol.2, issue.2, pp.323-343, 2009.
DOI : 10.1137/080725891

I. F. Gorodnitsky and B. D. Rao, Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm, IEEE Transactions on Signal Processing, vol.45, issue.3, pp.600-616, 1997.
DOI : 10.1109/78.558475

M. Robert, L. G. Haralick, and . Shapiro, Image segmentation techniques, 1985.

R. Horst and H. Tuy, Global optimization -deterministic approache, 1996.

C. Huang, T. Cheng, and C. Chen, Color images' segmentation using scale space filter and markov random field, Pattern Recognition, vol.25, issue.10, pp.1217-1229, 1992.
DOI : 10.1016/0031-3203(92)90023-C

J. Huang, M. K. Ng, H. Rong, and Z. Li, Automated variable weighting in k-means type clustering, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.5, pp.657-668, 2005.
DOI : 10.1109/TPAMI.2005.95

K. Jiang, Q. Liao, and S. Dai, A novel white blood cell segmentation scheme using scale-space filtering and watershed clustering, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), pp.2820-2825, 2003.
DOI : 10.1109/ICMLC.2003.1260033

L. Jing, M. K. Ng, J. Huang, and . Zhexue, An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.8, pp.1026-1041, 2007.
DOI : 10.1109/TKDE.2007.1048

E. Kokiopoulou, D. Kressner, N. Paragios, and P. Frossard, Optimal Image Alignment With Random Projections of Manifolds: Algorithm and Geometric Analysis, Proceedings of EUSIPCO, 2009.
DOI : 10.1109/TIP.2010.2102044

K. Kreutz-delgado, J. F. Murray, B. D. Rao, K. Engan, T. Lee et al., Dictionary Learning Algorithms for Sparse Representation, Neural Computation, vol.15, issue.2, pp.349-396, 2003.
DOI : 10.1162/089976601300014385

M. Lai, Y. Xu, and W. Yin, Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization, SIAM Journal on Numerical Analysis, vol.51, issue.2, pp.927-957, 2013.
DOI : 10.1137/110840364

P. J. Laurent, Approximation et optimisation, volume 1 of Collection Enseignement des sciences, 1972.

L. Hoai and M. T. Ta, Dc programming and dca for solving minimum sum-of-squares clustering using weighted dissimilarity measures. Transaction Computational Collective Intelligence, pp.113-131, 2014.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and P. Bouvry, A deterministic optimization approach for generating highly nonlinear balanced boolean functions in cryptography, Modeling, Simulation and Optimization of Complex Processes, pp.381-391, 2008.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and P. Bouvry, A combined dca: Ga for constructing highly nonlinear balanced boolean functions in cryptography, Journal of Global Optimization, vol.47, issue.4, pp.597-613, 2010.

M. L. Hoai, A. Yassine, and R. Moussi, Dca for solving the scheduling of lifting vehicle in an automated port container terminal, Computational Management Science, vol.9, issue.2, pp.273-286, 2012.

M. L. Hoai, H. A. Le-thi, and M. C. Nguyen, Dca based algorithms for feature selection in semi-supervised support vector machines, Machine Learning and Data Mining in Pattern Recognition, pp.528-542, 2013.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and V. N. Huynh, Block clustering based on difference of convex functions (dc) programming and dc algorithms, Neural Computation, issue.10, pp.252776-2807, 2013.

M. L. Hoai, T. B. Nguyen, M. T. Ta, and H. A. Le-thi, Image segmentation via feature weighted fuzzy clustering by a dca based algorithm, Advanced Computational Methods for Knowledge Engineering, pp.53-63

H. A. Le-thi, Analyse numérique des algorithmes de l'optimisation DC. Approches locale et globale. Codes et simulations numériques en grande dimension. Applications, Thèse de doctorat, 1994.

H. A. Le-thi, ContributionàContributionà l'optimisation non convexe et l'optimisation globale: Théorie, Algoritmes et Applications, 1997.

H. A. Le-thi, Dc programming and dca in machine learning, 2012.

H. A. Le-thi, A new approximation for the l 0 ?norm. Research report lita ea 3097, 2012.

H. A. Le-thi and M. Moeini, Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm, Journal of Optimization Theory and Applications, vol.196, issue.1???2, pp.199-224, 2014.
DOI : 10.1016/j.ejor.2008.03.015

URL : https://hal.archives-ouvertes.fr/hal-01636672

H. A. Le-thi and T. Pham-dinh, Solving a class of linearly constrained indefinite quadratic problems by dc algorithms, Journal of Global Optimization, vol.11, issue.3, pp.253-285, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01636781

H. A. Le-thi and T. Pham-dinh, Dc programming approach for solving the multidimensional scaling problem. Nonconvex Optimizations and Its Applications: Special Issue From Local to Global Optimization, pp.231-276, 2001.

H. A. Le-thi and T. Pham-dinh, Dc programming: Theory, algorithms and applications, The State of the Proceedings of The First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos' 02), 2002.

H. A. Le-thi and T. Pham-dinh, Large-scale molecular optimization from distance matrices by a d.c. optimization approach, SIAM Journal on Optimization, vol.14, issue.1, pp.77-114, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01636768

H. A. Le-thi and T. Pham-dinh, The dc (difference of convex functions) programming and dca revisited with dc models of real world nonconvex optimization problems, Annals of Operations Research, vol.133, pp.23-46, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01636759

H. A. Le-thi and T. Pham-dinh, DC programming in communication systems: challenging problems and methods, Vietnam Journal of Computer Science, vol.56, issue.10, pp.15-28
DOI : 10.1109/TVT.2006.873836

URL : https://hal.archives-ouvertes.fr/hal-01636673

H. A. Le-thi and D. Q. Tran, Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA, Optimization, vol.8, issue.8, pp.611025-1038, 2012.
DOI : 10.1016/S0165-1889(99)00088-3

URL : https://hal.archives-ouvertes.fr/hal-01636734

H. A. Le-thi and D. Q. Tran, Optimizing a multi-stage production/inventory system by DC programming based approaches, Computational Optimization and Applications, vol.8, issue.1, pp.441-468, 2014.
DOI : 10.1016/0305-0483(80)90003-1

URL : https://hal.archives-ouvertes.fr/hal-01636676

H. A. Le-thi, T. Pham-dinh, and M. L. Dung, Exact penalty in d.c. programming, Vietnam Journal of Mathematics, vol.27, issue.2, pp.169-178, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01664702

H. A. Le-thi, T. Pham-dinh, and V. T. Nguyen, Combination between global and local methods for solving an optimization problem over the efficient set, European Journal of Operational Research, vol.142, issue.2, pp.257-270, 2002.
DOI : 10.1016/S0377-2217(01)00301-0

URL : https://hal.archives-ouvertes.fr/hal-01636770

H. A. Le-thi, T. Pham-dinh, and V. N. Huynh, Exact penalty techniques in dc programming, LMI, National Institute for Applied Sciences, 2005.

H. A. Le-thi, M. T. Belghiti, and T. Pham-dinh, A new efficient algorithm based on dc programming and dca for clustering, Journal of Global Optimization, vol.37, issue.4, pp.593-608, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01636755

H. A. Le-thi, M. L. Hoai, and T. Pham-dinh, Optimization based dc programming and dca for hierarchical clustering, European Journal of Operational Research, vol.183, issue.3, pp.1067-1085, 2007.

H. A. Le-thi, M. L. Hoai, and T. Pham-dinh, Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms, Advances in Data Analysis and Classification, vol.15, issue.3, pp.85-104, 2007.
DOI : 10.1515/9781400873173

URL : https://hal.archives-ouvertes.fr/hal-01636753

H. A. Le-thi, T. P. Nguyen, and T. Pham-dinh, A continuous dc programming approach to the strategic supply chain design problem from qualified partner set, European Journal of Operational Research, vol.183, issue.3, pp.1001-1012, 2007.

H. A. Le-thi, M. L. Hoai, T. P. Nguyen, and T. Pham-dinh, Noisy image segmentation by a robust clustering algorithm based on dc programming and dca, ICDM, pp.72-86, 2008.

H. A. Le-thi, M. L. Hoai, V. V. Nguyen, and T. Pham-dinh, A DC programming approach for feature selection in support vector machines learning, Advances in Data Analysis and Classification, vol.3, issue.1???3, pp.259-278, 2008.
DOI : 10.1007/978-1-4757-2440-0

URL : https://hal.archives-ouvertes.fr/hal-01636751

H. A. Le-thi, M. L. Hoai, V. V. Nguyen, and T. Pham-dinh, Combined feature selection and classification using DCA, 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies, pp.233-239, 2008.
DOI : 10.1109/RIVF.2008.4586361

H. A. Le-thi, Q. T. Nguyen, K. Phan-tran, and T. Pham-dinh, Energy minimization-based cross-layer design in wireless networks, Proceeding of the High Performance Computing & Simulation Conference, pp.283-289, 2008.

H. A. Le-thi, V. V. Nguyen, and O. Samir, Gene Selection for Cancer Classification Using DCA, Advanced Data Mining and Applications, pp.62-72, 2008.
DOI : 10.1007/978-3-540-88192-6_8

URL : https://hal.archives-ouvertes.fr/hal-01664633

H. A. Le-thi, M. Moeini, and T. Pham-dinh, Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA, Computational Management Science, vol.20, issue.3, pp.459-475, 2009.
DOI : 10.1515/9781400873173

URL : https://hal.archives-ouvertes.fr/hal-01636746

H. A. Le-thi, M. Moeini, and T. Pham-dinh, DC programming approach for portfolio optimization under step increasing transaction costs, Optimization, vol.22, issue.3, pp.267-289, 2009.
DOI : 10.1016/j.amc.2005.05.005

URL : https://hal.archives-ouvertes.fr/hal-01636747

H. A. Le-thi, Q. T. Nguyen, H. T. Nguyen, and T. Pham-dinh, Solving the earliness tardiness scheduling problem by dc programming and dca, Mathematica Balkanica, pp.271-288, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01664541

H. A. Le-thi, Q. T. Nguyen, H. T. Nguyen, and T. Pham-dinh, A time-indexed formulation of earliness tardiness scheduling via dc programming and dca, Computer Science and Information Technology IMCSIT '09. International Multiconference on, pp.779-784, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01025671

H. A. Le-thi, T. Pham-dinh, and S. Bouallagui, Cryptanalysis of an identification scheme based on the perceptron problem using a hybridization of deterministic optimization and genetic algorithm, Proceedings of the 2009 International Conference on Security and Management, World Congress in Computer Science Computer Engineering, and Applied Computing, pp.117-123, 2009.

H. A. Le-thi, T. Pham-dinh, and V. N. Huynh, Exact penalty and error bounds in DC programming, Journal of Global Optimization, vol.92, issue.2, pp.509-535, 2012.
DOI : 10.1007/s101070100278

URL : https://hal.archives-ouvertes.fr/hal-01636730

H. A. Le-thi, T. Pham-dinh, and D. Q. Tran, A DC programming approach for a class of bilevel programming problems and its application in portfolio selection, Numerical Algebra, Control and Optimization (NACO), vol.2, issue.1, pp.167-185, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01636726

H. A. Le-thi, M. T. Le, and T. B. Nguyen, A novel approach to automated cell counting based on a difference of convex functions algorithm (dca), Computational Collective Intelligence. Technologies and Applications, pp.336-345

H. A. Le-thi, M. L. Hoai, T. Pham-dinh, and V. N. Huynh, Binary classification via spherical separator by DC programming and DCA, Journal of Global Optimization, vol.15, issue.4, pp.1393-1407, 2013.
DOI : 10.1162/08997660360581958

URL : https://hal.archives-ouvertes.fr/hal-01636671

H. A. Le-thi, T. B. Nguyen, and M. L. Hoai, Sparse Signal Recovery by Difference of Convex Functions Algorithms, Intelligent Information and Database Systems, pp.387-397
DOI : 10.1007/978-3-642-36543-0_40

H. A. Le-thi, D. Q. Tran, and H. A. Kondo, A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors, Journal of Industrial and Management Optimization (JIMO), pp.1-20, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01387300

H. A. Le-thi, X. T. Vo, and T. Pham-dinh, Robust Feature Selection for SVMs under Uncertain Data, Advances in Data Mining. Applications and Theoretical Aspects, pp.151-165
DOI : 10.1007/978-3-642-39736-3_12

URL : https://hal.archives-ouvertes.fr/hal-01636653

H. A. Le-thi, P. Damel, P. Nadège, and T. P. Nguyen, The Confrontation of Two Clustering Methods in Portfolio Management: Ward???s Method Versus DCA Method, Advanced Computational Methods for Knowledge Engineering of Advances in Intelligent Systems and Computing, pp.87-98, 2014.
DOI : 10.1007/978-3-319-06569-4_6

H. A. Le-thi, A. V. Le, X. T. Vo, and Z. Ahmed, A Filter Based Feature Selection Approach in MSVM Using DCA and Its Application in Network Intrusion Detection, Intelligent Information and Database Systems, pp.403-413, 2014.
DOI : 10.1007/978-3-319-05458-2_42

H. A. Le-thi, M. L. Hoai, and T. Pham-dinh, New and efficient dca based algorithms for minimum sum-of-squares clustering, Pattern Recognition, vol.47, issue.1, pp.388-401, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01636670

H. A. Le-thi, T. Pham-dinh, M. L. Hoai, and X. T. Vo, DC approximation approaches for sparse optimization, European Journal of Operational Research, vol.244, issue.1, 2014.
DOI : 10.1016/j.ejor.2014.11.031

URL : https://hal.archives-ouvertes.fr/hal-01634220

H. A. Le-thi and M. Moeini, Portfolio selection under buy-in threshold constraints using dc programming and dca, Service Systems and Service Management, pp.296-300, 2006.

H. A. Le-thi, Dc programming and dca
URL : https://hal.archives-ouvertes.fr/hal-01664024

H. Lee, A. Battle, R. Raina, and A. Ng, Efficient sparse coding algorithms, Advances in Neural Information Processing Systems, vol.19, pp.801-808, 2007.

S. Z. Li, Markov Random Field Modeling in Image Analysis, 2009.
DOI : 10.1007/978-4-431-67044-5

J. Liang, M. Fadili, and G. Peyre, Local linear convergence of forward?backward under partial smoothness, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01150460

Q. Liao and Y. Deng, An accurate segmentation method for white blood cell images, IEEE Intl Sym on Biomedical Imaging, pp.245-248, 2002.

F. J. Benjamin and . Logan, Properties of high-pass signals, 1965.

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online learning for matrix factorization and sparse coding, J. Mach. Learn. Res, vol.11, pp.19-60, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00408716

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.
DOI : 10.1109/78.258082

D. Martin, C. Fowlkes, D. Tal, and J. Malik, A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.416-423, 2001.
DOI : 10.1109/ICCV.2001.937655

G. Matheron, Random Sets and Integral Geometry, 1974.

G. H. Mohimani, M. Babaie-zadeh, and C. Jutten, Fast Sparse Representation Based on Smoothed ???0 Norm, 7th International Conference on Independent Component Analysis and Signal Separation (ICA2007), pp.389-396, 2007.
DOI : 10.1007/978-3-540-74494-8_49

URL : https://hal.archives-ouvertes.fr/hal-00173357

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

M. Mohri and A. Medina, Learning theory and algorithms for revenue optimization in second-price auctions with reserve, Proceedings of the 31st International Conference on Machine Learning, 2014.

M. Mokhtar, A. Shuib, and D. Mohamad, Mathematical programming models for portfolio optimization problem: A review, International Journal of Social, Human Science and Engineering, vol.8, issue.2, pp.76-83

. Database and . Nanotechweb, Nanotechweb image database, 2014.

B. K. Natarajan, Sparse Approximate Solutions to Linear Systems, SIAM Journal on Computing, vol.24, issue.2, pp.97-5397, 1995.
DOI : 10.1137/S0097539792240406

B. Ndiaye, T. Pham-dinh, and H. A. Le-thi, Single straddle carrier routing problem in port container terminals: Mathematical model and solving approaches, International Journal of Intelligent Information and Database Systems IJIIDS, pp.21-31, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01664533

D. Needell and J. A. Tropp, CoSaMP, Communications of the ACM, vol.53, issue.12, pp.301-321, 2009.
DOI : 10.1145/1859204.1859229

C. N. Nguyen, H. A. Le-thi, and T. Pham-dinh, A branch and bound algorithm based on dc programming and dca for strategic capacity planning in supply chain design for a new market opportunity, Operations Research Proceedings 2006, volume 2006 of Operations Research Proceedings, pp.515-520, 2007.

D. M. Nguyen, La programmation DC et la méthode Cross-Entropy pour certaines classes deprobì emes en finance, affectation et recherche d'informations : codes et simulations numériques, doctorale Sciences Physiques Mathématiques et de l'Information pour l'ingénieur, 2012.

D. M. Nguyen, H. A. Le-thi, and T. Pham-dinh, A Cross-Entropy Method for Value-at-Risk Constrained Optimization, Intelligent Information and Database Systems, pp.442-451, 2011.
DOI : 10.1023/A:1010091220143

Q. T. Nguyen and H. A. Le-thi, Solving an Inventory Routing Problem in Supply Chain by DC Programming and DCA, Intelligent Information and Database Systems, pp.432-441, 2011.
DOI : 10.1007/978-3-540-87477-5_40

B. A. Olshausen and D. J. Field, Sparse coding with an overcomplete basis set: A strategy employed by V1?, Vision Research, vol.37, issue.23, pp.3311-3325, 1997.
DOI : 10.1016/S0042-6989(97)00169-7

N. R. Pal and S. K. , A review on image segmentation techniques, Pattern Recognition, vol.26, issue.9, pp.1277-1294, 1993.
DOI : 10.1016/0031-3203(93)90135-J

W. Pan, X. Shen, and B. Liu, Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty, Journal of Machine Learning Research, vol.14, issue.1, pp.1865-1889, 2013.

D. K. Panjwani and G. Healey, Unsupervised segmentation of textured colour images using markov random field models. Pattern Analysis and Machine Intelligence, IEEE Transactions, vol.17, pp.939-954, 1993.

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, pp.40-44, 1993.
DOI : 10.1109/ACSSC.1993.342465

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

V. N. Pham, Programmation DC et DCA pour l'optimisation non convexe/optimisation globale en variables mixtesentì eres. Codes et Applications, LMI, Ecole doctorale Sciences Physiques Mathématiques et de l'Information pour l'ingénieur, 2013.

V. N. Pham, H. A. Le-thi, and T. Pham-dinh, A dc programming framework for portfolio selection by minimizing the transaction costs, Advanced Computational Methods for Knowledge Engineering, pp.31-40

T. and P. Dinh, Elements homoduaux relatifsàrelatifsà un couple de normes (?, ?). applications au calcul de s ?? (a), 1975.

T. and P. Dinh, Calcul du maximum d'une forme quadratique définie positive sur la boule unité de la norme du max, 1976.

T. and P. Dinh, Algorithms for solving a class of non convex optimization problems. Methods of subgradients, 1986.

T. , P. Dinh, and S. E. Bernoussi, Duality in d. c. (difference of convex functions) optimization. Subgradient methods. Trends in mathematical optimization, 4th French-German Conference, pp.277-293, 1986.

P. Dinh and H. A. Le-thi, Convex analysis approach to d.c. programming: theory, algorithms and applications, Acta Mathematica Vietnamica, vol.22, issue.1, pp.289-355, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01664714

T. , P. Dinh, and H. A. Le-thi, Recent advances in dc programming and dca, Transactions on Computational Collective Intelligence, vol.8342, pp.1-37, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01664024

P. Dinh and H. A. Le-thi, Dc optimization algorithms for solving the trust region subproblem, SIAM Journal of Optimization, vol.8, issue.2, pp.476-505, 1998.

T. Pham-dinh, C. N. Nguyen, and H. A. Le-thi, DC programming and DCA for globally solving the value-at-risk, Computational Management Science, vol.8, issue.1, pp.477-501, 2009.
DOI : 10.21314/JOR.2000.038

URL : https://hal.archives-ouvertes.fr/hal-01636750

T. Pham-dinh, V. N. Pham, and H. A. Le-thi, DC Programming and DCA for Portfolio Optimization with Linear and Fixed Transaction Costs, Intelligent Information and Database Systems, pp.392-402
DOI : 10.1007/978-3-319-05458-2_41

D. N. Phan, M. C. Nguyen, and H. A. Le-thi, A dc programming approach for sparse linear discriminant analysis, Advanced Computational Methods for Knowledge Engineering of Advances in Intelligent Systems and Computing, pp.65-74

R. Prony, Essai expérimental et analytique sur les lois de la dilatabilité des uidesélastiqueuidesélastique et sur celles de la force expansive de la vapeur de leau et de la vapeur de lalkool, ` a différentes températures, J. ´ Ecole Polytechnique, vol.1, pp.24-76, 1975.

B. D. Rao and K. Kreutz-delgado, An affine scaling methodology for best basis selection, IEEE Transactions on Signal Processing, vol.47, issue.1, pp.87-200, 1999.
DOI : 10.1109/78.738251

N. Rao and F. Porikli, A clustering approach to optimize online dictionary learning, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.1293-1296, 2012.
DOI : 10.1109/ICASSP.2012.6288126

F. Rinaldi, Mathematical Programming Methods for minimizing the zero norm over polyhedral sets, 2009.

F. Rinaldi, Concave programming for finding sparse solutions to problems with convex constraints. Optimization Methods and Software, pp.971-992, 2011.

F. Rinaldi, F. Schoen, and M. Sciandrone, Concave programming for minimizing the zero-norm over polyhedral sets, Computational Optimization and Applications, vol.3, issue.3, pp.467-486, 2010.
DOI : 10.1007/978-3-642-99789-1_13

R. T. Rockafellar, Convex Analysis, 1970.
DOI : 10.1515/9781400873173

L. I. Rudin, S. Osher, and E. Fatemi, Nonlinear total variation based noise removal algorithms, Physica D: Nonlinear Phenomena, vol.60, issue.1-4, pp.259-268, 1992.
DOI : 10.1016/0167-2789(92)90242-F

F. Santosa and W. W. Symes, Linear Inversion of Band-Limited Reflection Seismograms, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.4, pp.1307-1330, 1986.
DOI : 10.1137/0907087

P. Schmieder, A. S. Stern, G. Wagner, and J. C. Hoch, Application of nonlinear sampling schemes to COSY-type spectra, Journal of Biomolecular NMR, vol.3, issue.5, pp.559-576, 1993.
DOI : 10.1007/BF00174610

C. Schnörr, Signal and image approximation with level-set constraints, Computing, vol.27, issue.2, pp.137-160, 2007.
DOI : 10.1017/CBO9780511983658

J. Serra, Image Analysis and Mathematical Morphology, 1983.

K. Siang, T. , and N. Isa, Color image segmentation using histogram thresholding ??? Fuzzy C-means hybrid approach, Pattern Recognition, vol.44, issue.1, pp.1-15, 2011.
DOI : 10.1016/j.patcog.2010.07.013

U. Sipi-image and . Database, The usc-sipi image database, 2014.

W. Skarbek and A. Koschan, Colour image segmentation: A survey, 1994.

W. Skarbek and A. Koschan, Colour image segmentation: A survey, 1994.

K. Skretting and K. Engan, Recursive Least Squares Dictionary Learning Algorithm, IEEE Transactions on Signal Processing, vol.58, issue.4, pp.2121-2130, 2010.
DOI : 10.1109/TSP.2010.2040671

T. Sparco, Sparco: A toolbox for testing sparse reconstruction algorithms, 2014.

A. S. Ta, Programmation DC et DCA pour la résolution de certaines classes desprobì emes dans les systèmes de transport et de communication, LMI, Ecole doctorale Sciences Physiques Mathématiques et de l'Information pour l'ingénieur, 2012.

A. S. Ta, H. A. Le-thi, D. Khadui, and T. Pham-dinh, Solving qos routing problems by dca, Intelligent Information and Database Systems, pp.460-470, 2010.

A. S. Ta, H. A. Le-thi, D. Khadui, and T. Pham-dinh, Solving multicast qos routing problem in the context v2i communication services using dca, Computer and Information Science (ICIS) IEEE/ACIS 9th International Conference, pp.471-476, 2010.

A. S. Ta, H. A. Le-thi, D. Khadui, and T. Pham-dinh, Solving Partitioning-Hub Location-Routing Problem using DCA, Journal of Industrial and Management Optimization, vol.8, issue.1, pp.87-102, 2012.
DOI : 10.3934/jimo.2012.8.87

URL : https://hal.archives-ouvertes.fr/hal-01636727

A. S. Ta, T. Pham-dinh, H. A. Le-thi, and D. Khadui, Solving many to many multicast qos routing problem using dca and proximal decomposition technique, International Conference on Computing, Networking and Communications (ICNC2012), pp.809-814, 2012.

M. T. Ta, Techniques d'optimisation non convexe basée sur la programmation DC et DCA et méthodes méthodesévolutives pour la classification non supervisée, 2014.

H. L. Taylor, S. C. Banks, and J. F. Mccoy, Deconvolution with the ???1 norm, GEOPHYSICS, vol.44, issue.1, pp.39-52, 1979.
DOI : 10.1190/1.1440921

R. I. Taylor and P. H. Lewis, Colour image segmentation using boundary relaxation. pages III, pp.721-724, 1992.

N. Theera-umpon, White Blood Cell Segmentation and Classification in Microscopic Bone Marrow Images, Proceedings of the Second International Conference on Fuzzy Systems and Knowledge Discovery - Volume Part II, volume 3614 of FSKD'05, pp.787-796, 2005.
DOI : 10.1007/11540007_98

S. Theodoridis, Y. Kopsinis, and K. Slavakis, Sparsity-Aware Learning and Compressed Sensing: An Overview, 2012.
DOI : 10.1016/B978-0-12-396502-8.00023-1

M. Thiao, T. Pham-dinh, and H. A. Le-thi, DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm, Communications in Computer and Information Science, vol.209, issue.1, pp.348-357, 2008.
DOI : 10.1016/S0304-3975(97)00115-1

M. Thiao, T. Pham-dinh, and H. A. Le-thi, A dc programming approach for sparse eigenvalue problem, Internationale Conference on Machine learninh ICML 2010, pp.1063-1070, 2010.

X. Tian, G. Gasso, and S. Canu, A multiple kernel framework for inductive semi-supervised SVM learning, Advances in artificial neural networks, machine learning, and computational intelligence, pp.46-58, 2011.
DOI : 10.1016/j.neucom.2011.12.036

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society (Series B), vol.58, issue.1, pp.267-288, 1996.

J. F. Toland, Duality in nonconvex optimization, Journal of Mathematical Analysis and Applications, vol.66, issue.2, pp.399-415, 1978.
DOI : 10.1016/0022-247X(78)90243-3

J. B. Urruty, Generalized differentiability duality and optimization for problem dealing with differences of convex functions, Lecture Notes in Economics and Mathematical Systems, vol.256, pp.260-277, 1986.

J. and V. Llahi, Color Constancy and Image Segmentation Techniques for Applications to Mobile Robotics, 2005.

L. Vincent and P. Soille, Watersheds in digital spaces: an efficient algorithm based on immersion simulations, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.6, pp.583-598, 1991.
DOI : 10.1109/34.87344

N. Vucic, S. Shi, and M. Schubert, Dc programming approach for resource allocation in wireless networks, WiOpt, pp.380-386, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00502213

W. Osher, D. Yin, J. Goldfarb, and . Darbon, Bregman iterative algorithms for ? 1 minimization with applications to compressed sensing, SIAM Journal on Imaging Sciences, vol.1, pp.143-168, 2008.

J. Wang, X. Shen, and W. Pan, On efficient large margin semisupervised learning: Method and theory, Journal of Machine Learning Research, vol.10, pp.719-742, 2009.

K. Wang, P. Zhong, and Y. Zhao, Training robust support vector regression via d. c. program, Journal of Information & Computational Science, vol.7, issue.12, pp.2385-2394, 2010.

S. Weber, T. Schüle, A. Kuba, and C. Schnörr, Binary Tomography with Deblurring, Combinatorial Image Analysis, pp.375-388, 2006.
DOI : 10.1007/11774938_30

J. Weston, A. Elisseeff, B. Schölkopf, and M. Tipping, Use of the zero norm with linear models and kernel methods, Journal of Machine Learning Research, vol.3, pp.1439-1461, 2003.

L. B. Wolff, Diffuse-reflectance model for smooth dielectric surfaces, Journal of the Optical Society of America A, vol.11, issue.11, pp.2956-2968, 1994.
DOI : 10.1364/JOSAA.11.002956

C. Wu, C. Li, and Q. Long, A DC programming approach for sensor network localization with uncertainties in anchor positions, Journal of Industrial and Management Optimization, vol.10, issue.3, pp.817-826, 2014.
DOI : 10.3934/jimo.2014.10.817

L. Yang and L. Wang, A class of semi-supervised support vector machines by DC programming, Advances in Data Analysis and Classification, vol.112, issue.15
DOI : 10.1016/j.talanta.2013.03.016

P. Yin, Y. Lou, Q. He, and J. Xin, Minimizaiton of ? 1 ? ? 2 for compressed sensing

Y. Ying, K. Huang, and C. Campbell, Enhanced protein fold recognition through a novel data integration approach, BMC Bioinformatics, vol.10, issue.1, p.267, 2009.
DOI : 10.1186/1471-2105-10-267

S. Zhang, Y. Zhan, Y. Zhou, M. Uzunbas, and D. N. Metaxas, Shape Prior Modeling Using Sparse Representation and Online Dictionary Learning, MICCAI (3), pp.435-442, 2012.
DOI : 10.1007/978-3-642-33454-2_54

T. Zhang, Some sharp performance bounds for least squares regression with L 1 regularization, The Annals of Statistics, vol.37, issue.5A, pp.2109-2144, 2009.
DOI : 10.1214/08-AOS659

Y. Zhao and D. Li, Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems, SIAM Journal on Optimization, vol.22, issue.3, pp.1065-1088, 2012.
DOI : 10.1137/110847445

Y. Zhong and E. Aghezzaf, A dc programming approach to solve the single-vehicle inventory routing problem, Proceedings of the international conference CIE39, 2009.

Y. Zhong and E. Aghezzaf, Combining DC-programming and steepest-descent to solve the single-vehicle inventory routing problem, Computers & Industrial Engineering, vol.61, issue.2, pp.313-321, 2011.
DOI : 10.1016/j.cie.2011.02.006

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

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