{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T02:35:51Z","timestamp":1773455751470,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T00:00:00Z","timestamp":1155081600000},"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":[[2007,2,20]]},"DOI":"10.1007\/s10898-006-9066-4","type":"journal-article","created":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T10:14:08Z","timestamp":1155032048000},"page":"593-608","source":"Crossref","is-referenced-by-count":44,"title":["A new efficient algorithm based on DC programming and DCA for clustering"],"prefix":"10.1007","volume":"37","author":[{"given":"Le Thi Hoai","family":"An","sequence":"first","affiliation":[]},{"given":"M. Tayeb","family":"Belghiti","sequence":"additional","affiliation":[]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,9]]},"reference":[{"key":"9066_CR1","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1991","unstructured":"Alon N., Spencer J.H. (1991): The Probabilistic Method. Wiley, New York, NY"},{"key":"9066_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Kannan, R.: Learning mixtures of arbitrary Gaussians. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, July 6\u20138, pp. 247\u2013257. Heraklion, Crete, Greece (2001)","DOI":"10.1145\/380752.380808"},{"issue":"9","key":"9066_CR3","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0031-3203(95)00022-R","volume":"28","author":"K. Al-Sultan","year":"1995","unstructured":"Al-Sultan K. (1995): A Tabu search approach to the clustering problem. Pattern Recogn. 28(9): 443\u20131453","journal-title":"Pattern Recogn."},{"key":"9066_CR4","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Clustering via concave minimization, Technical Report 96-03, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin May 1996. Advances In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Neural Information processing Systems 9, pp. 368\u2013374. MIT Press, Cambridge, MA Available by ftp:\/\/ftp.cs.wisc.edu\/math-prog\/tech-trports\/96-03.ps.Z."},{"key":"9066_CR5","unstructured":"Bradley, B.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Shavlik, J. (eds.) Machine Learning Proceedings of the Fifteenth International Conferences(ICML\u201998), pp. 82\u201390. San Francisco, CA 1998, Morgan Kaufmann."},{"key":"9066_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 17\u201318 October, pp. 378\u2013388. New York, NY, USA (1999)","DOI":"10.1109\/SFFCS.1999.814609"},{"key":"9066_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing pp. 1\u201310 (1999)","DOI":"10.1145\/301250.301257"},{"key":"9066_CR8","first-page":"133","volume-title":"Statistics.","author":"J. De Leeuw","year":"1997","unstructured":"De Leeuw J. (1997): Applications of convex analysis to multidimensional scaling, Recent developments. In: Barra J.R., et\u00a0al. (eds). Statistics. North-Holland Publishing company, Amsterdam, pp. 133\u2013145"},{"key":"9066_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01897162","volume":"5","author":"J. De Leeuw","year":"1988","unstructured":"De Leeuw J. (1988): Convergence of the majorization method for multidimensional scaling. J. Classi. 5, 163\u2013180","journal-title":"J. Classi."},{"key":"9066_CR10","first-page":"73","volume-title":"A Comprehensive Survey of Text Mining.","author":"I.S. Dhilon","year":"2003","unstructured":"Dhilon I.S., Korgan J., Nicholas C. (2003): Feature Selection and Document Clustering. In: Berry M.W. (eds). A Comprehensive Survey of Text Mining. Springer-Verlag, Berlin, pp. 73\u2013100"},{"key":"9066_CR11","volume-title":"Pattern Classification and Scene Analysis","author":"R.O. Duda","year":"1972","unstructured":"Duda R.O., Hart P.E. (1972): Pattern Classification and Scene Analysis. Wiley, New York"},{"key":"9066_CR12","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC) May 2\u20134, Chicago, Illinois, USA (1988)","DOI":"10.1145\/62212.62255"},{"key":"9066_CR13","first-page":"139","volume":"2","author":"D. Fisher","year":"1988","unstructured":"Fisher D. (1988): Knowledge acquisition via incremental conceptual clusterin. Mach. Learning, 2, 139\u2013172","journal-title":"Mach. Learning,"},{"key":"9066_CR14","volume-title":"Statistical Pattern Recognition","author":"K. Fukunaga","year":"1990","unstructured":"Fukunaga K. (1990): Statistical Pattern Recognition. Academic Press, NY"},{"key":"9066_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.B. Hiriart Urruty","year":"1993","unstructured":"Hiriart Urruty J.B., Lemarechal C. (1993): Convex Analysis and Minimization Algorithms. Springer Verlag, Berlin, Heidelberg"},{"key":"9066_CR16","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain A.K., Dubes R.C. (1988): Algorithms for Clustering Data. Prentice-Hall Inc, Englewood Cliffs, NJ"},{"key":"9066_CR17","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan J.A. (1975): Clustering Algorithms. Wiley, New York"},{"key":"9066_CR18","unstructured":"Le Thi Hoai An: Contribution \u00e0 l\u2019optimisation non convexe et l\u2019optimisation globale: Th\u00e9orie, Algoritmes et Applications. Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 de Rouen, Juin (1997)"},{"issue":"3","key":"9066_CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"An LeThi Hoai","year":"1997","unstructured":"Le Thi Hoai An, Pham Dinh Tao (1997): Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optim. 11(3): 253\u2013285","journal-title":"J. Global Optim."},{"key":"9066_CR20","doi-asserted-by":"crossref","unstructured":"Le Thi Hoai An, Pham Dinh Tao: DC programming approach for large-scale molecular optimization via the general distance geometry problem. Nonconvex Optimization and Its Applications, Special Issue \u201cOptimization in Computational Chemistry and Molecular Biology: Local and Global Approaches\u201d, pp. 301\u2013339. Kluwer Academic Publishers, Dordrecht (2000) (This special issue contains refereed invited papers submitted at the conference on optimization in computational chemistry and molecular biology: local and global approaches held at Princeton University, 7\u20139 May 1999)","DOI":"10.1007\/978-1-4757-3218-4_18"},{"key":"9066_CR21","volume-title":"DC programming approach for solving the multidimensional scaling problem","author":"An LeThi Hoai","year":"2001","unstructured":"Le Thi Hoai An, Pham Dinh Tao (2001): DC programming approach for solving the multidimensional scaling problem. Nonconvex optimizations and its applications: special issue \u201cFrom local to global optimization\u201d, pp. 231\u2013276. Kluwer Academic Publishers, Dordrecht"},{"key":"9066_CR22","unstructured":"Le Thi Hoai An, Pham Dinh Tao: DC programming: theory, algorithms and applications. The state of the art. In Proceedings of The First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos\u2019 02), 28 p. Valbonne-Sophia Antipolis, France, 2\u20134 October (2002)"},{"issue":"1","key":"9066_CR23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"An LeThi Hoai","year":"2003","unstructured":"Le Thi Hoai An, Pham Dinh Tao (2003): Large Scale Molecular Optimization from distances matrices by a DC optimization approach. SIAM J. Optim. 14(1): 77\u2013116","journal-title":"SIAM J. Optim."},{"key":"9066_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"An LeThi Hoai","year":"2005","unstructured":"Le Thi Hoai An, Pham Dinh Tao (2005): 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","journal-title":"Ann. Oper. Res."},{"key":"9066_CR25","unstructured":"Liu, Y., Shen, X., Doss, H.: Multicategory \u03c8\u2013learning and support vector machine (29 p.). Conference on Machine Learning, Statistics and Discovery, June 22\u201326, Department of Statistics, the Ohio State University (2003)"},{"key":"9066_CR26","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1009735908398","volume":"1","author":"O.L. Mangasarian","year":"1997","unstructured":"Mangasarian O.L. (1997): Mathematical programming in data mining. Data Mining and Knowl. discov. 1, 183\u2013201","journal-title":"Data Mining and Knowl. discov."},{"key":"9066_CR27","unstructured":"MacQueen J.B. (1967): Some Methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability\u201d, Berkeley, University of California Press,1, 281\u2013297"},{"key":"9066_CR28","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/B:MACH.0000033115.78247.f0","volume":"56","author":"A. Meyerson","year":"2004","unstructured":"Meyerson A., O\u2019Callaghan L., Plotkin S. (2004): A k-Median algorithm with running time independent of data size. Machine Learn. 56, 61\u201387","journal-title":"Machine Learn."},{"key":"9066_CR29","doi-asserted-by":"crossref","unstructured":"Neumann, J., Schn\u00f6rr, C., Steidl, G.: SVM-based feature selection by direct objective minimisation, Pattern Recognition. In: Proceeding of 26th DAGM Symposium, vol. 3175, pp. 212\u2013219, LNCS (2004)","DOI":"10.1007\/978-3-540-28649-3_26"},{"key":"9066_CR30","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0024-3795(84)90093-4","volume":"62","author":"Tao. Pham Dinh","year":"1984","unstructured":"Pham Dinh Tao. (1984): Convergence of subgradient method for computing the bound-norm of matrices, Linear Algebra Appl. 62, 163\u2013182","journal-title":"Linear Algebra Appl."},{"key":"9066_CR31","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01391415","volume":"45","author":"Tao. Pham Dinh","year":"1984","unstructured":"Pham Dinh Tao. (1984): Algorithmes de calcul d\u2019une forme quadratique sur la boule unit\u00e9 de la norme du maximum. Numer. Math. 45, 377\u2013440","journal-title":"Numer. Math."},{"issue":"h birthday, 22(","key":"9066_CR32","first-page":"289","volume":"70","author":"Tao Pham Dinh","year":"1997","unstructured":"Pham Dinh Tao, Le Thi Hoai An.(1997): Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday), 22(1): 289\u2013355","journal-title":"Acta Mathematica Vietnamica, (dedicated to Professor Hoang Tuy on the occasion of his"},{"key":"9066_CR33","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"Tao Pham Dinh","year":"1998","unstructured":"Pham Dinh Tao, Le Thi Hoai An. (1998): DC optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476\u2013505","journal-title":"SIAM J. Optim."},{"key":"9066_CR34","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M.R. Rao","year":"1971","unstructured":"Rao M.R. (1971): Cluster analysis and mathematical programming. J. Amer. Stat. Associ., 66, 622\u2013626","journal-title":"J. Amer. Stat. Associ.,"},{"key":"9066_CR35","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T. (1970): Convex Analysis. Princeton University, Princeton"},{"key":"9066_CR36","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TPAMI.1984.4767478","volume":"PAMI-6","author":"S.Z. Selim","year":"1984","unstructured":"Selim S.Z., Ismail M.A. (1984): K-means-Type algorithms: a generalized convergence theorem and characterization of local optimilaty. (Book Series) IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-6, 81\u201387","journal-title":"(Book Series) IEEE Transactions on Pattern Analysis and Machine Intelligence,"},{"key":"9066_CR37","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.dam.2005.02.028","volume":"151","author":"T. Sch\u00fcle","year":"2005","unstructured":"Sch\u00fcle T., Schn\u00f6rr C., Weber S., Hornegger J. (2005): Discrete tomography by convex-concave regularization and d.c. programming. Discr. Appl. Math. 151, 229\u2013243","journal-title":"Discr. Appl. Math."},{"key":"9066_CR38","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.endm.2005.05.071","volume":"20","author":"S. Weber","year":"2005","unstructured":"Weber S., Sch\u00fcle T., Schn\u00f6rr C. (2005): Prior learning and convex-concave regularization of binary tomography. Electr. Notes in Discr. Math. 20, 313\u2013327","journal-title":"Electr. Notes in Discr. Math."},{"key":"9066_CR39","unstructured":"Weber S., Schn\u00f6rr C., Sch\u00fcle T., Hornegger J., (2005): Binary Tomography by Iterating Linear Programs, Klette, R., Kozera, R., Noakes, L., and Weickert, J., (eds.) Computational Imaging and Vision \u2013 Geometric Properties from Incomplete Data, Kluwer Academic Press, Dordrecht"},{"key":"9066_CR40","doi-asserted-by":"crossref","unstructured":"Wong, T., Katz, R., McCanne, S.: A preference clustering protocol for large-Scale Multicast Applications, Proceedings of the First International COST264 Workshop on Networked Group Communication, November 17\u201320, LNCS, pp. 1\u201318. Pisa, Italy (1999)","DOI":"10.1007\/978-3-540-46703-8_1"},{"issue":"2","key":"9066_CR41","first-page":"77","volume":"17","author":"W.H. Wolberg","year":"1995","unstructured":"Wolberg W.H., Street W.N., Mangasarian O.L. (1995): Image analysis and machine learning applied to breast cancer diagnosis and prognosis. Anal. Quant. Cytol. Histol. 17(2): 77\u201387","journal-title":"Anal. Quant. Cytol. Histol."},{"key":"9066_CR42","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1001\/archsurg.1995.01430050061010","volume":"130","author":"W.H. Wolberg","year":"1995","unstructured":"Wolberg W.H., Street W.N., Heisey D.M., Mangasarian O.L. (1995):Computerized breast cancer diagnosis and prognosis from fine-needle aspirates. Arch. Surg. 130, 511\u2013516","journal-title":"Arch. Surg."},{"key":"9066_CR43","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1016\/0046-8177(95)90229-5","volume":"26","author":"W.H. Wolberg","year":"1995","unstructured":"Wolberg W.H., Street W.N., Heisey D.M., Mangasarian O.L. (1995): Computer-derived nuclear features distinguish malignant from benign breast cytology. Hum. Patholo., 26, 792\u2013796","journal-title":"Hum. Patholo.,"},{"key":"9066_CR44","volume-title":"The Concave-Convex Procedure (CCCP)","author":"A.L. Yuille","year":"2002","unstructured":"Yuille A.L., Rangarajan A. (2002): The Concave-Convex Procedure (CCCP). Avances in Neural Information Processing Systems 14, pp. 1033\u20131040. MIT Press, Cambridge, MA"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9066-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9066-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9066-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T10:28:20Z","timestamp":1736504900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9066-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,9]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,2,20]]}},"alternative-id":["9066"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9066-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,9]]}}}