F. Akoa, Combining DC Algorithms (DCAs) and Decomposition Techniques for the Training of Nonpositive–Semidefinite Kernels, IEEE Transactions on Neural Networks, vol.19, issue.11, pp.1854-1872, 2008.
DOI : 10.1109/TNN.2008.2003299

A. D. Aleksandrov, On surfaces represented as the difference of convex functions, Izvestiya Akad Nauk Kazah. SSR. Ser. Mat. Meh, vol.60, issue.3, 1949.

F. Alizadeh, Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization, SIAM Journal on Optimization, vol.5, issue.1, pp.13-51, 1993.
DOI : 10.1137/0805002

U. Alon, N. Barkai, D. A. Notterman, K. Gish, S. Ybarra et al., Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon cancer tissues, Cell Biology, vol.96, pp.6745-6750, 1999.

A. Argyriou, R. Hauser, C. A. Micchelli, and M. Pontil, A DC-programming algorithm for kernel selection, Proceedings of the 23rd international conference on Machine learning , ICML '06, pp.41-48, 2006.
DOI : 10.1145/1143844.1143850

A. Astorino, A. Fuduli, and M. Gaudioso, DC models for spherical separation, Journal of Global Optimization, vol.2, issue.4, pp.657-669, 2010.
DOI : 10.1007/s10898-010-9558-0

M. Atteia and A. Elqortobi, Quasi-convex duality Optimization and Optimal Control, Proc. Conference Oberwolfach, pp.3-8, 1980.

R. Baraniuk, M. Davenport, R. Devore, and M. Wakin, A Simple Proof of the Restricted Isometry Property for Random Matrices, Constructive Approximation, vol.159, issue.2, pp.253-263, 2008.
DOI : 10.1007/s00365-007-9003-x

M. T. Belghiti, H. A. Le-thi, and T. Pham-dinh, Clustering via DC programming & DCA. Modelling, Computation and Optimization in Information Systems and Management Sciences, Hermes Science Publishing, pp.499-507, 2004.

K. P. Bennet and A. Demiriz, Semi-Supervised Support Vector Machines, Proceedings of the Conference Neural Information Processing Systems (NIPS), 1998.

P. Bloomfield and W. Steiger, Least Absolute Deviations : Theory, Applications , and Algorithms, 1983.
DOI : 10.1007/978-1-4684-8574-5

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

P. S. Bradley and O. L. Mangasarian, Feature selection via concave minimization and support vector machines, Proceedings of the Fifteenth International Conference on Machine Learning, pp.82-90, 1998.

A. M. Bruckstein, D. L. Donoho, and M. Elad, From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images, SIAM Review, vol.51, issue.1, pp.34-81, 2009.
DOI : 10.1137/060657704

C. J. Burges, A tutorial on Support Vector Machines for patterns recognition, Data Mining and Knowledge Discovery, vol.2, issue.2, pp.121-167, 1998.
DOI : 10.1023/A:1009715923555

J. Cadima and I. T. Jolliffe, Loadings and correlations in the interpretation of principal components, Applied Statistics, pp.203-214, 1995.

E. Candès and J. Romberg, l1-magic, 2007.

E. Candès, J. Romberg, 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. Candès, 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.
DOI : 10.1109/TIT.2005.862083

E. Candès, J. 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.1002/cpa.20124

E. Candès 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

E. Candès and T. Tao, The Dantzig selector : statistical estimation when P is much larger than N. The Annals of Statistics, pp.2392-2404, 2007.

E. Candès, M. Wakin, and S. Boyd, Enhancing sparsity by reweighted l1 minimization, J. Fourier Analysis and Applications, 2008.

C. Chapelle, V. Sindhwani, S. S. Keerthi, and N. Cristianini, Optimization Techniques for Semi-Supervised Support Vector Machines, Journal of Machine Learning Research, vol.9, pp.203-233, 2008.

R. Chartrand and V. Staneva, Restricted isometry properties and nonconvex compressive sensing, Inverse Problems, vol.24, issue.3, pp.1-14, 2008.
DOI : 10.1088/0266-5611/24/3/035020

S. S. Chen, D. L. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7694

X. Chen, F. M. Xu, and Y. Ye, Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization, SIAM Journal on Scientific Computing, vol.32, issue.5, pp.2832-2852, 2010.
DOI : 10.1137/090761471

R. Collobert, F. Sinz, J. Weston, and L. Bottou, Large Scale Transductive SVMs, Journal of Machine Learning Research, vol.7, pp.1687-1712, 2006.

R. Collobert, F. Sinz, J. Weston, and L. Bottou, Trading convexity for scalability, Proceedings of the 23rd international conference on Machine learning , ICML '06, 2006.
DOI : 10.1145/1143844.1143870

C. Cortes and V. Vapnik, Support-vector networks, Machine Learning, pp.273-297, 1995.
DOI : 10.1007/BF00994018

A. Aspremont, F. Bach, and L. Ghaoui, Full regularization path for sparse principal component analysis, Proceedings of the 24th International Conference on Machine Learning, 2007.

A. Aspremont, F. Bach, and L. Ghaoui, Optimal Solutions for Sparse Principal Component Analysis, Journal of Machine Learning Research, vol.9, pp.1269-1294, 2008.

A. Aspremont, L. Ghaoui, M. I. Jordan, and G. R. Lanckriet, A Direct Formulation for Sparse PCA Using Semidefinite Programming, SIAM Review, vol.49, issue.3, pp.434-448, 2007.
DOI : 10.1137/050645506

I. Daubechies, M. Defrise, and C. De-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

R. A. Devore and V. N. Temlyakov, Some remarks on greedy algorithms, Advances in Computational Mathematics, vol.102, issue.1, pp.173-187, 1996.
DOI : 10.1007/BF02124742

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, 2004.
DOI : 10.1002/cpa.20132

D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal ) dictionaries via l1 minimization, Proc. Natl. Acad. Sci. USA, pp.2197-2202, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.9300

D. L. Donoho and J. Tanner, Sparse nonnegative solution of underdetermined linear equations by linear programming, Proc. Natl. Acad. Sci. USA, pp.9446-9451, 2005.
DOI : 10.1073/pnas.0502269102

B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, Least angle regression, Ann Stat, vol.32, pp.407-499, 2004.

L. Ghaoui, On the quality of a semidefinite programming bound for sparse principal component analysis. arXive.org, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.4174

M. A. Figueiredo, R. D. Nowak, and S. J. Wright, Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems, IEEE Journal of Selected Topics in Signal Processing, vol.1, issue.4, 2007.
DOI : 10.1109/JSTSP.2007.910281

I. Frank and J. Friedman, A Statistical View of Some Chemometrics Regression Tools, Technometrics, vol.5, issue.2, pp.109-148, 1993.
DOI : 10.1080/00401706.1993.10485033

J. Friedman, R. Tibshirani, and T. Hastie, Regularization Paths for Generalized Linear Models via Coordinate Descent, Journal of Statistical Software, vol.33, issue.1, p.2010, 2010.
DOI : 10.18637/jss.v033.i01

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

G. M. Fung and O. L. Mangasarian, Semi-Supervised Support Vector Machines for Unlabeled Data Classificatio. Optimization Methods and Software, pp.29-44, 2001.

G. M. Fung and O. L. 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, 2011.
DOI : 10.1007/s10957-011-9871-x

A. Gammerman, V. Vapnik, and V. Vovk, Learning by Transduction, Uncertainty in Artificial Intelligence, 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

. Lander, Molecular classification of cancer : class discovery and class prediction by gene expression monitoring, Science, vol.286, pp.531-537, 1999.

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

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-00570057

I. Guyon and A. Elisseeff, An introduction to variable and feature selection, J. Mach. Learn. Res, vol.3, pp.1157-1182, 2003.

E. Hale, W. Yin, and Y. Zhang, Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence, SIAM Journal on Optimization, vol.19, issue.3, pp.1107-1130, 2008.
DOI : 10.1137/070698920

P. Hartman, On functions representable as a difference of convex functions, Pacific Journal of Mathematics, vol.9, issue.3, pp.707-713, 1959.
DOI : 10.2140/pjm.1959.9.707

T. Hastie, R. Tibshirani, and J. Friedman, The elements of statistical learning, 2001.

R. Helgason, J. Kennington, and H. Lall, A polynomially bounded algorithm for a singly constrained quadratic program, Mathematical Programming, pp.338-343, 1980.
DOI : 10.1007/BF01588328

J. B. Hiriart-urruty, Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions, Lecture Notes in Economics and Mathematical System, vol.256, pp.37-70, 1986.
DOI : 10.1007/978-3-642-45610-7_3

J. B. Hiriart-urruty and C. Lemarechal, Convex Analysis and Minimization algorithms, 1993.
DOI : 10.1007/978-3-662-02796-7

R. Horst, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization, Journal of Optimization Theory and Applications, vol.34, issue.1, pp.11-37, 1988.
DOI : 10.1007/BF00939768

R. Horst, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Journal of Optimization Theory and Applications, vol.7, issue.2, pp.271-291, 1988.
DOI : 10.1007/BF00939825

R. Horst, P. M. Pardalos, and N. V. Thoai, Introduction to global optimization, 2000.
DOI : 10.1007/978-1-4615-0015-5

R. Horst and N. V. Thoai, DC Programming: Overview, Journal of Optimization Theory and Applications, vol.1, issue.1, pp.1-43, 1999.
DOI : 10.1023/A:1021765131316

R. Horst and H. Tuy, On the convergence of global methods in multiextremal optimization, Journal of Optimization Theory and Applications, vol.5, issue.2, pp.253-271, 1987.
DOI : 10.1007/BF00939434

R. Horst and H. Tuy, Global Optimization : Deterministic Approaches. 2nd revised edition, 1993.

J. Huang, J. Horowitz, and S. Ma, Asymptotic properties of bridge estimators in sparse high-dimensional regression models, The Annals of Statistics, vol.36, issue.2, pp.587-613, 2008.
DOI : 10.1214/009053607000000875

J. Jeffers, Two Case Studies in the Application of Principal Component Analysis, Applied Statistics, vol.16, issue.3, pp.225-236, 1967.
DOI : 10.2307/2985919

T. Joachims, Transductive inference for text classification using support vector machines, Proceedings of the International Conference on Machine Learning, ICML, 1999.

I. T. Jolliffe, N. V. Trendafilov, and M. Uddin, A Modified Principal Component Technique Based on the LASSO, Journal of Computational and Graphical Statistics, vol.12, issue.3, pp.531-547, 2003.
DOI : 10.1198/1061860032148

S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, An Interior-Point Method for Large-Scale -Regularized Least Squares, IEEE Journal of Selected Topics in Signal Processing, vol.1, issue.4, pp.606-617, 2007.
DOI : 10.1109/JSTSP.2007.910971

K. Knight and W. Fu, Asymptotics for lasso-type estimators, Annals of Statistics, vol.28, pp.1356-1378, 2000.

R. Kohavi and G. H. John, Wrappers for feature subset selection, Artificial Intelligence, vol.97, issue.1-2, pp.273-324, 1997.
DOI : 10.1016/S0004-3702(97)00043-X

N. Krause and Y. Singer, Leveraging the margin more carefully, Twenty-first international conference on Machine learning , ICML '04, 2004.
DOI : 10.1145/1015330.1015344

J. B. Lasserre, Global Optimization with Polynomials and the Problem of Moments, SIAM Journal on Optimization, vol.11, issue.3, pp.796-817, 2001.
DOI : 10.1137/S1052623400366802

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

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

H. A. Le-thi, An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints, pp.401-426, 2000.

H. A. Le-thi, Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and DC programming, Jounal of Global Optimization, vol.27, pp.375-397, 2003.

H. A. Le-thi, M. T. Belghiti, and T. Pham-dinh, A new efficient algorithm based on DC programming and DCA for clustering, J. Glob. Opt, vol.37, pp.593-608, 2007.

H. A. Le-thi, N. Huynh, T. Van, and . Pham-dinh, Convergence analysis of DC Algorithm for DC programming with subanalytic data, Technical Report National Institute for Applied Sciences, 2009.

H. A. Le-thi, M. L. Hoai, P. Nguyen-trong, and T. Pham-dinh, Noisy Image Segmentation by a Robust Clustering Algorithm Based on DC Programming and DCA, Proceedings of the 8th industrial conference on Advances in Data Mining : Medical Applications, E-Commerce, Marketing, and Theoretical Aspects, 2008.

H. A. Le-thi, M. L. Hoai, V. Nguyen, T. Van, and . Pham-dinh, A DC programming approach for feature selection in support vector machines learning Advances in Data Analysis and Classification, pp.259-278, 2008.

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, pp.85-104, 2007.

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, pp.1067-1085, 2007.

H. A. Le-thi, M. L. Hoai, T. Pham-dinh, N. Huynh, and . Van, Binary classification via spherical separator by DC programming and DCA, Journal of Global Optimization, vol.15, issue.4, 2011.
DOI : 10.1007/s10898-012-9859-6

H. A. Le-thi, M. L. Hoai, T. Pham-dinh, N. Huynh, and . Van, Block Clustering based on DC programming and DCA, 2011.

H. A. Le-thi, V. V. Nguyen, and S. Ouchani, Gene Selection for Cancer Classification Using DCA. Advanced Data Mining And Appications, pp.62-72, 2008.

H. A. Le-thi and T. Pham-dinh, Solving a class of linearly contrained indefinite quadratic problems by DC Algorithms, Journal of Global Optimization, vol.11, pp.253-285, 1997.

H. A. Le-thi and T. Pham-dinh, A Branch and Bound Method via DC Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems, Journal of Global Optimization, vol.13, pp.171-206, 1998.

H. A. Le-thi and T. Pham-dinh, A continuous approach for globally solving linearly constrained quadratic zero-one programming problems, Optimization, vol.50, issue.12, pp.93-120, 2001.

H. A. Le-thi and T. Pham-dinh, A continuous approach for large-scale constrained quadratic zero-one programming, Honor of Professor EL- STER, Founder of the Journal Optimization) Optimization, pp.1-28, 2001.

H. A. Le-thi and T. Pham-dinh, Large Scale Molecular Optimization From Distance Matrices by a DC Optimization Approach, SIAM Journal on Optimization, vol.4, issue.1, pp.77-116, 2003.

H. A. Le-thi and T. Pham-dinh, The DC (difference of convex functions) Programming and DCA revisited with DC models of real world non convex optimization problems, Annals of Operations Research, vol.133, pp.23-46, 2005.

H. A. Le-thi and T. Pham-dinh, Minimum Sum-of-Squares Clustering by DC Programming and DCA, Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications (ICIC), pp.327-340, 2009.

H. A. Le-thi, T. Pham-dinh, N. Huynh, and . Van, Exact penalty and error bounds in DC programming, Journal of Global Optimization, vol.92, issue.2, 2011.
DOI : 10.1007/s10898-011-9765-3

H. A. Le-thi, T. Pham-dinh, and M. L. Dung, Exact Penalty in DC Programming, Vietnam Journal of Mathematics, vol.27, issue.2, pp.169-179, 1999.

M. L. Thi, H. A. , 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/s11634-008-0030-7

Y. Liu and X. Shen, -Learning, Journal of the American Statistical Association, vol.101, issue.474, pp.500-509, 2006.
DOI : 10.1198/016214505000000781
URL : https://hal.archives-ouvertes.fr/tel-00259428

Y. Liu, X. Shen, and H. Doss, Multicategory ??-Learning and Support Vector Machine: Computational Tools, Journal of Computational and Graphical Statistics, vol.14, issue.1, pp.219-236, 2005.
DOI : 10.1198/106186005X37238

L. Mackey, Deflation methods for Sparse PCA, Proceedings of the Conference Neural Information Processing Systems, 2008.

S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Transactions on Signal Processing, vol.41, issue.12, pp.3397-1993, 1993.
DOI : 10.1109/78.258082

O. L. Mangasarian, Machine Learning via Polyhedral Concave Minimization, Applied Mathematics and Parallel Computing, pp.175-188, 1996.
DOI : 10.1007/978-3-642-99789-1_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3952

S. Mendelson, A. Pajor, and N. Tomczak-jaegermann, Uniform uncertainty principle for Bernoulli and subgaussian ensembles. arXiv :math/0608665, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00793740

B. Moghaddam, Y. Weiss, and S. Avidan, Generalized spectral bounds for sparse LDA, Proceedings of the 23rd international conference on Machine learning , ICML '06, 2006.
DOI : 10.1145/1143844.1143925

B. Moghaddam, Y. Weiss, and S. Avidan, Spectral bounds for sparse PCA : Exact and greedy algorithms, Advances in Neural Information Processing Systems, 2006.

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

J. Neumann, C. Schnörr, and G. Steidl, SVM-based Feature Selection by Direct Objective Minimisation, Pattern Recognition, Proc. of 26th DAGM Symposium, 2004.

J. Neumann, C. Schnörr, and G. Steidl, Combined SVM-Based Feature Selection and Classification, Machine Learning, pp.129-150, 2005.
DOI : 10.1007/s10994-005-1505-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.568.9948

Y. S. Niu, Programmation DC et DCA en Optimisation Combinatoire et Optimisation Polynomiale via les techniques de SDP, Thèse de Doctorat, Institut National des Sciences Appliquées de Rouen, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00557911

M. Osborne, B. Presnell, and B. Turlach, A new approach to variable selection in least squares problems, IMA Journal of Numerical Analysis, vol.20, issue.3, pp.389-403, 2000.
DOI : 10.1093/imanum/20.3.389

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

J. P. Penot, Duality for anticonvex programs, Journal of Global Optimization, vol.19, issue.2, pp.163-182, 2001.
DOI : 10.1023/A:1008327614099

T. and P. Dinh, Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme maximum. Séminaire d'analyse numérique, 1976.

T. and P. Dinh, Algorithmes de calcul d'une forme quadratique sur la boule unité de la norme maximum, Num. Math, vol.45, pp.377-440, 1985.

T. , P. Dinh, and S. Bernoussi, Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. Fermat Days 85 Mathematics for optimization, 1986.

T. , P. Dinh, and S. Bernoussi, Duality in DC (difference of convex functions) Optimization. Subgradient Methods, Trends in Mathematical Optimization, pp.277-293, 1988.

T. , P. Dinh, and H. A. Le-thi, Stabilité de la dualité lagrangienne en optimisation DC (différence de deux fonctions convexes), C.R. Acad. Paris. Série, vol.1, 1994.

T. , P. Dinh, and H. A. Le-thi, Convex Analysis Approaches to DC Programming : Theory, Algorithms and Applications, Acta Mathematica Vietnamica, vol.22, issue.1, pp.289-355, 1997.

T. , P. Dinh, and H. A. Le-thi, A DC optimization algorithm for solving the trust region subproblem, SIAM J. Optim, pp.476-507, 1998.

T. , P. Dinh, and H. A. Le-thi, DC Programming. Theory, Algorithms, Applications : The state of the art. First International Workshop on Global Constrained Optimization and Constraint Satisfaction, 2002.

T. Pham-dinh, H. A. Le-thi, and F. Akoa, Combining DCA and interior point techniques for large-scale nonconvex quadratic programming. Optimization, Methods and Softwares, pp.609-629, 2008.

T. Pham-dinh, H. A. Le-thi, and F. Akoa, Combining DCA (DC Algorithms) and Interior Point Techniques for large-scale Nonconvex Quadratic Programming . Optimization Methods and Software, pp.609-629, 2008.

T. Pham-dinh, N. Nguyen-canh, and H. A. Le-thi, An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs, Journal of Global Optimization, vol.30, issue.1, pp.595-632, 2010.
DOI : 10.1007/s10898-009-9507-y

N. Quadrianto, J. Petterson, and A. J. Smola, Distribution Matching for Transduction, Proceedings of the Conference Neural Information Processing Systems, 2009.

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

Y. Saad, Projection and deflation method for partial pole assignment in linear state feedback, IEEE Transactions on Automatic Control, vol.33, issue.3, pp.290-297, 1998.
DOI : 10.1109/9.406

T. Schüle, C. Schnörr, S. Weber, and J. Hornegger, Discrete tomography by convex???concave regularization and D.C. programming, Discrete Applied Mathematics, vol.151, issue.1-3, pp.229-243, 2005.
DOI : 10.1016/j.dam.2005.02.028

X. Shen, G. C. Tseng, X. Zhang, and W. H. Wong, On ??-Learning, Journal of the American Statistical Association, vol.98, issue.463, pp.724-734, 2003.
DOI : 10.1198/016214503000000639

A. J. Smola and B. Schölkopf, A tutorial on support vector regression, Statistics and Computing, vol.14, issue.3, pp.2-1998, 1998.
DOI : 10.1023/B:STCO.0000035301.49549.88

B. K. Sriperumbudur, D. A. Torres, and G. R. Lanckriet, Sparse eigen methods by DC Programming, Proceedings of the 24th International Conference on Machine Learning, pp.831-838, 2007.

P. T. Quynh, H. A. Le-thi, and T. Pham-dinh, On the global solution of linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method, RAIRO, Rech. Opér, vol.30, pp.31-49, 1996.

P. T. Quynh, H. A. Le-thi, and T. Pham-dinh, Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, Oper. Res. Lett, vol.17, pp.215-222, 1996.

M. Thiao, T. Pham-dinh, and H. A. Le-thi, DC programming approach for a class of nonconvex programs involving zero-norm, Communications in Computer and Information Science, vol.14, pp.358-367, 2008.

M. Thiao, T. Pham-dinh, and H. A. Le-thi, A DC programming approach for sparse eigenvalue problem, Proceedings of the 27th International Conference on Machine Learning, pp.1063-1070, 2010.

M. Thiao, T. Pham-dinh, and H. A. Le-thi, Solutions of a linear program with an additional Euclidean unit ball constraint by a customized polynomial algorithm, Laboratory of Mathematics, 2009.

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society, vol.46, pp.431-439, 1996.

J. F. Toland, Duality in Nonconvex Optimisation, J. Mathematical Analysis and Applications, vol.58, pp.415-428, 1978.

J. F. Toland, On Subdifferential Calculus and Duality in Nonconvex Optimization, Bull. Soc. Math. France, Mémoire, vol.60, pp.177-183, 1979.

J. A. Tropp, Greed is Good: Algorithmic Results for Sparse Approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.
DOI : 10.1109/TIT.2004.834793

J. A. Tropp, Topics in Sparse Approximation, 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.
DOI : 10.1109/TIT.2005.864420

H. Tuy, Global minimization of a difference of two convex functions. Selected Topics in Oper, Res. and Math. Economics, Lecture Notes in Economics and Mathematical Systems, vol.256, pp.98-118, 1984.

H. Tuy, T. V. Thieu, and N. Q. Thai, A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set, Mathematics of Operations Research, vol.10, issue.3, pp.498-514, 1985.
DOI : 10.1287/moor.10.3.498

V. Vapnik, The Nature of Statistical Learning Theory, 1995.

V. Vapnik, Statistical Learning Theory, 1998.

R. M. Ventura, Sparse Image Approximation with Application To Flexible Image Coding, 2005.

J. Wang, X. Shen, and W. Pan, On transductive support vector machines, Contemp. Math, vol.43, pp.7-19, 2007.
DOI : 10.1090/conm/443/08551

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.

S. Weber, A. Nagy, T. Schüle, C. Schnörr, and A. Kuba, A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography, Proceedings of the Conference on Discrete Geometry on Computer Imagery, p.4245, 2006.
DOI : 10.1007/11907350_13

S. Weber, T. Schüle, and C. Schnörr, Prior Learning and Convex-Concave Regularization of Binary Tomography, Electronic Notes in Discrete Mathematics, vol.20, pp.313-327, 2005.
DOI : 10.1016/j.endm.2005.05.071

S. Weber, T. Shüle, J. Hornegger, and C. Schnörr, Binary Tomography by Iterating Linear Programs from Noisy Projections, Proceedings of International Workshop on Combinatorial Image Analysis (IWCIA), 2004.
DOI : 10.1007/978-3-540-30503-3_3

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.

P. White, The Computation of Eigenvalues and Eigenvectors of a Matrix, Journal of the Society for Industrial and Applied Mathematics, vol.6, issue.4, pp.393-437, 1958.
DOI : 10.1137/0106027

H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of Semidefinite Programming, 2000.
DOI : 10.1007/978-1-4615-4381-7

Y. Wu and Y. Liu, Variable selection in quantile regression, Statistica Sinica, vol.19, pp.801-817, 2009.

A. Y. Yang, Compressed sensing meets machine learning-classification of mixture subspace models via sparse representation. Mini Lectures in Image Processing, 2008.

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

A. Yuille and A. Rangarajan, The Concave-Convex Procedure, Neural Computation, vol.39, issue.4, pp.915-936, 2003.
DOI : 10.1162/08997660260028674

T. Zhang, Some sharp performance bounds for least squares regression with l1 regularization, 2007.

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 T. Hastie, Regularization and variable selection via the elastic net, Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.5, issue.2, pp.301-320, 2005.
DOI : 10.1073/pnas.201162998

H. Zou, T. Hastie, and R. Tibshirani, Sparse Principal Component Analysis, Journal of Computational and Graphical Statistics, vol.15, issue.2, pp.265-286, 2006.
DOI : 10.1198/106186006X113430