{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T21:15:20Z","timestamp":1766870120944,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T00:00:00Z","timestamp":1503964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T00:00:00Z","timestamp":1503964800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1411817"],"award-info":[{"award-number":["1411817"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11590-017-1183-0","type":"journal-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T09:11:22Z","timestamp":1503997882000},"page":"455-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Nesterov\u2019s smoothing technique and minimizing differences of convex functions for hierarchical clustering"],"prefix":"10.1007","volume":"12","author":[{"given":"N. M.","family":"Nam","sequence":"first","affiliation":[]},{"given":"W.","family":"Geremew","sequence":"additional","affiliation":[]},{"given":"S.","family":"Reynolds","sequence":"additional","affiliation":[]},{"given":"T.","family":"Tran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"key":"1183_CR1","first-page":"503","volume":"27","author":"LTH An","year":"2007","unstructured":"An, L.T.H., Belghiti, M.T., Tao, P.D.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 27, 503\u2013608 (2007)","journal-title":"J. Glob. Optim."},{"key":"1183_CR2","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.ejor.2005.07.028","volume":"183","author":"LTH An","year":"2007","unstructured":"An, L.T.H., Minh, L.H.: Optimization based DC programming and DCA for hierarchical clustering. Eur. J. Oper. Res. 183, 1067\u20131085 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1183_CR3","first-page":"289","volume":"22","author":"LTH An","year":"1997","unstructured":"An, L.T.H., Tao, P.D.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"1183_CR4","first-page":"75","volume":"19","author":"A Bagirov","year":"1999","unstructured":"Bagirov, A.: Derivative-free methods for unconstrained nonsmooth optimization and its numerical analysis. Investig. Oper. 19, 75\u201393 (1999)","journal-title":"Investig. Oper."},{"key":"1183_CR5","unstructured":"Bagirov, A., Jia, L., Ouveysi, I., Rubinov, A.M.: Optimization based clustering algorithms in multicast group hierarchies. In: Proceedings of the Australian Telecommunications, Networks and Applications Conference (ATNAC), Melbourne, Australia (published on CD, ISNB 0-646-42229-4) (2003)"},{"key":"1183_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.patcog.2015.11.011","volume":"53","author":"A Bagirov","year":"2016","unstructured":"Bagirov, A., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognit. 53, 12\u201324 (2016)","journal-title":"Pattern Recognit."},{"key":"1183_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.2140\/pjm.1959.9.707","volume":"9","author":"P Hartman","year":"1959","unstructured":"Hartman, P.: On functions representable as a difference of convex functions. Pac. J. Math. 9, 707\u2013713 (1959)","journal-title":"Pac. J. Math."},{"key":"1183_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10957-017-1075-6","volume":"173","author":"NM Nam","year":"2017","unstructured":"Nam, N.M., Rector, R.B., Giles, D.: Minimizing differences of convex functions with applications to facility location and clustering. J. Optim. Theory Appl. 173, 255\u2013278 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"1183_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1183_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"1183_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10898-014-0171-5","volume":"61","author":"B Ordin","year":"2015","unstructured":"Ordin, B., Bagirov, A.: A heuristic algorithm for solving the minimum sum-of-squares clustering problems. J. Glob. Optim. 61, 341\u2013361 (2015)","journal-title":"J. Glob. Optim."},{"key":"1183_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB: a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"1183_CR13","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1183_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate Duality and Optimization","author":"RT Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)"},{"key":"1183_CR15","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"PD Tao","year":"1998","unstructured":"Tao, P.D., An, L.T.H.: A d.c. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1183-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1183-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1183-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T17:47:55Z","timestamp":1589651275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1183-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,29]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1183"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1183-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2017,8,29]]},"assertion":[{"value":"4 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}