{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:20:50Z","timestamp":1764688850309},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,11]],"date-time":"2012-02-11T00:00:00Z","timestamp":1328918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10898-012-9859-6","type":"journal-article","created":{"date-parts":[[2012,2,10]],"date-time":"2012-02-10T14:04:50Z","timestamp":1328882690000},"page":"1393-1407","source":"Crossref","is-referenced-by-count":24,"title":["Binary classification via spherical separator by DC programming and DCA"],"prefix":"10.1007","volume":"56","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Hoai Minh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]},{"given":"Ngai","family":"Van Huynh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,11]]},"reference":[{"key":"9859_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1080\/10556780512331318254","volume":"20","author":"A. Astorino","year":"2005","unstructured":"Astorino A., Gaudioso M.: Ellipsoidal separation for classification problems. Optim. Methods Softw. 20, 267\u2013276 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9859_CR2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10287-007-0051-2","volume":"6","author":"A. Astorino","year":"2009","unstructured":"Astorino A., Gaudioso M.: A fixed-centre spherical separation algorithm with kernel transformations for classification problems. Comput. Manag. Sci. 6(3), 357\u2013372 (2009)","journal-title":"Comput. Manag. Sci."},{"issue":"4","key":"9859_CR3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s10898-010-9558-0","volume":"48","author":"A. Astorino","year":"2010","unstructured":"Astorino A., Fuduli A., Gaudioso M.: DC models for spherical separation. J. Glob. Optim. 48(4), 657\u2013669 (2010)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"9859_CR4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s11590-007-0074-1","volume":"2","author":"C. Audet","year":"2008","unstructured":"Audet C., Hansen P., Karam A., Ng C.D., Perron S.: Exact L2-norm plane separation. Optim. Lett. 2(4), 483\u2013495 (2008)","journal-title":"Optim. Lett."},{"key":"9859_CR5","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. COLT\u201992, Proceedings of the fifth annual workshop on Computational learning theory, pp. 144\u2013152 (1992)","DOI":"10.1145\/130385.130401"},{"key":"9859_CR6","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1147\/rd.266.0759","volume":"26","author":"E.R. Barnes","year":"1982","unstructured":"Barnes E.R.: An algorithm for separating patterns by ellipsoids. IBM. J. Res. Dev. 26, 759\u2013764 (1982)","journal-title":"IBM. J. Res. Dev."},{"key":"9859_CR7","unstructured":"DC Programming and DCA: http:\/\/lita.sciences.univ-metz.fr\/~lethi\/"},{"key":"9859_CR8","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1137\/S1052623402411459","volume":"14","author":"A. Fuduli","year":"2004","unstructured":"Fuduli A., Gaudioso M., Giallombardo G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14, 743\u2013756 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9859_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"H.A. Le Thi","year":"1997","unstructured":"Le Thi H.A., Pham D.T.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Glob. Optim. 11(3), 253\u2013285 (1997)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9859_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"H.A. Le Thi","year":"2003","unstructured":"Le Thi H.A., Pham D.T.: Large scale global molecular optimization from exact distance matrices by a DC optimization approach. SIAM J. Optim. 14(1), 77\u2013114 (2003)","journal-title":"SIAM J. Optim."},{"key":"9859_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Le Thi","year":"2005","unstructured":"Le Thi H.A., Pham D.T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9859_CR12","unstructured":"Le Thi, H.A., Van Nguyen, N., Pham D.T.: Convergence Analysis of DCA for DC programming with Subanalytic Data. Research Report, National Institute for Applied Sciences, Rouen-France (2008)"},{"issue":"2","key":"9859_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11634-007-0011-2","volume":"1","author":"H.A. Le Thi","year":"2007","unstructured":"Le Thi H.A., Le H.M., Pham D.T.: Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms. Adv. Data Anal. Classif. 1(2), 85\u2013104 (2007)","journal-title":"Adv. Data Anal. Classif."},{"key":"9859_CR14","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/j.ejor.2005.07.028","volume":"183","author":"H.A. Le Thi","year":"2007","unstructured":"Le Thi H.A., Le H.M., Pham D.T.: Optimization based DC programming and DCA for Hierarchical clustering. Eur. J. Oper. Res. 183, 1067\u20131085 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9859_CR15","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s10898-006-9066-4","volume":"37","author":"H.A. Le Thi","year":"2007","unstructured":"Le Thi H.A., Belghiti M.T., Pham D.T.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37, 593\u2013608 (2007)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9859_CR16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"H.A. Le Thi","year":"2008","unstructured":"Le Thi H.A., Le H.M., Van Nguyen V., Pham D.T.: A DC programming approach for feature selection in support vector machines learning. J. Adv. Data Anal. Classif. 2(3), 259\u2013278 (2008)","journal-title":"J. Adv. Data Anal. Classif."},{"key":"9859_CR17","first-page":"199","volume":"22","author":"O.L. Mangasarian","year":"1997","unstructured":"Mangasarian O.L.: Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Math. Vietnam. 22, 199\u2013205 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"9859_CR18","unstructured":"Mamadou, T., Pham D.T., Le Thi, H.A.: A DC programming approach for sparse eigenvalue problem. Proceedings of International Conference on Machine learninh ICML 2010, pp. 1063\u20131070 (2010)"},{"key":"9859_CR19","unstructured":"Pardalos, P.M., Hansen, P.: Data Mining and Mathematical Programming, CRM vol. 45. American Mathematical Society, ISBN-10: 0821843524 (2008)"},{"issue":"1","key":"9859_CR20","first-page":"289","volume":"22","author":"D.T. Pham","year":"1997","unstructured":"Pham D.T., Le Thi H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"9859_CR21","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"D.T. Pham","year":"1998","unstructured":"Pham D.T., Le Thi H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM J.Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J.Optim."},{"key":"9859_CR22","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0022-247X(65)90150-2","volume":"10","author":"J.B. Rosen","year":"1965","unstructured":"Rosen J.B.: Pattern separation by convex programming. J. Math. Anal. Appl. 10, 123\u2013134 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"9859_CR23","doi-asserted-by":"crossref","unstructured":"Sriperumbudur, B.K., Torres, D.A., Lanckriet, G.R.G.: Sparse Eigen methods by DC programming. In: Proceedings of the 24 th International Conference on Machine Learning, Corvallis, OR (2007)","DOI":"10.1145\/1273496.1273601"},{"key":"9859_CR24","first-page":"801","volume":"19","author":"Y. Wu","year":"2009","unstructured":"Wu Y., Liu Y.: Variable selection in quantile regression. Stat. Sin. 19, 801\u2013817 (2009)","journal-title":"Stat. Sin."},{"issue":"4","key":"9859_CR25","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A.L. Yuille","year":"2003","unstructured":"Yuille A.L., Rangarajan A.: The concave-convex procedure. Neural Comput. 15(4), 915\u2013936 (2003)","journal-title":"Neural Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9859-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9859-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9859-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T13:56:57Z","timestamp":1561298217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9859-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,11]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9859"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9859-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,11]]}}}