{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:27:35Z","timestamp":1780511255632,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071032"],"award-info":[{"award-number":["12071032"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10957-025-02616-5","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T16:29:33Z","timestamp":1739291373000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Euclidean Distance Matrix Model for Convex Clustering"],"prefix":"10.1007","volume":"205","author":[{"given":"Z. W.","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"X. W.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Q. N.","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"issue":"C","key":"2616_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.dsp.2016.05.006","volume":"55","author":"SH Bai","year":"2016","unstructured":"Bai, S.H., Qi, H.D.: Tackling the flip ambiguity in wireless sensor network localization and beyond. Digit. Signal. Process. 55(C), 85\u201397 (2016). https:\/\/doi.org\/10.1016\/j.dsp.2016.05.006","journal-title":"Digit. Signal. Process."},{"issue":"4","key":"2616_CR2","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TASE.2006.877401","volume":"3","author":"P Biswas","year":"2006","unstructured":"Biswas, P., Liang, T.C., Toh, K.C., Ye, Y., Wang, T.C.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Autom. Sci. Eng. 3(4), 360\u2013371 (2006). https:\/\/doi.org\/10.1109\/TASE.2006.877401","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"2616_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28981-X","volume-title":"Modern Multidimensional Scaling","author":"I Borg","year":"2007","unstructured":"Borg, I., Groenen, P.J.: Modern Multidimensional Scaling. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/0-387-28981-X"},{"issue":"4","key":"2616_CR4","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1080\/10618600.2014.948181","volume":"24","author":"EC Chi","year":"2015","unstructured":"Chi, E.C., Lange, K.: Splitting methods for convex clustering. J. Comput. Graph. Stat. 24(4), 994\u20131013 (2015). https:\/\/doi.org\/10.1080\/10618600.2014.948181","journal-title":"J. Comput. Graph. Stat."},{"key":"2616_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-33037-0_14","volume-title":"Multidimensional Scaling","author":"MAA Cox","year":"2008","unstructured":"Cox, M.A.A., Cox, T.F.: Multidimensional Scaling. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-33037-0_14"},{"key":"2616_CR6","volume-title":"Convex Optimization and Euclidean Distance Geometry","author":"J Dattorro","year":"2005","unstructured":"Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Meboo Publishing, Palo Alto (2005)"},{"issue":"1","key":"2616_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10107-016-1090-7","volume":"164","author":"C Ding","year":"2017","unstructured":"Ding, C., Qi, H.D.: Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction. Math. Program. 164(1), 341\u2013381 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1090-7","journal-title":"Math. Program."},{"issue":"2","key":"2616_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23(2), 298\u2013305 (1973)","journal-title":"Czechoslov. Math. J."},{"key":"2616_CR9","unstructured":"Gao, Y.: Structured low rank matrix optimization problems: A penalty approach. Ph.D. thesis, National University of Singapore (2010)"},{"key":"2616_CR10","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Loan, C.V.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)"},{"key":"2616_CR11","unstructured":"Hocking, T.D., Joulin, A., Bach, F., Vert, J.P.: Clusterpath: an algorithm for clustering using convex fusion penalties. In: Proceedings of the 28th International Conference on International Conference on Machine Learning, pp. 745\u2013752 (2011)"},{"issue":"1","key":"2616_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985). https:\/\/doi.org\/10.1007\/BF01908075","journal-title":"J. Classif."},{"issue":"4","key":"2616_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.4208\/jcm.1702-m2016-0748","volume":"35","author":"QN Li","year":"2017","unstructured":"Li, Q.N., Qi, H.D.: An inexact smoothing Newton method for Euclidean distance matrix optimization under ordinal constraints. J. Comput. Math. 35(4), 469\u2013485 (2017). https:\/\/doi.org\/10.4208\/jcm.1702-m2016-0748","journal-title":"J. Comput. Math."},{"issue":"2","key":"2616_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10589-010-9374-y","volume":"50","author":"QN Li","year":"2011","unstructured":"Li, Q.N., Qi, H.D., Xiu, N.H.: Block relaxation and majorization methods for the nearest correlation matrix with factor structure. Comput. Optim. Appl. 50(2), 327\u2013349 (2011). https:\/\/doi.org\/10.1007\/s10589-010-9374-y","journal-title":"Comput. Optim. Appl."},{"key":"2616_CR15","doi-asserted-by":"publisher","unstructured":"Lindsten, F., Ohlsson, H., Ljung, L.: Clustering using sum-of-norms regularization: with application to particle filter output computation. In: IEEE Statistical Signal Processing Workshop, pp. 201\u2013204 (2011). https:\/\/doi.org\/10.1109\/SSP.2011.5967659","DOI":"10.1109\/SSP.2011.5967659"},{"issue":"2","key":"2616_CR16","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10589-020-00189-9","volume":"76","author":"ST Lu","year":"2020","unstructured":"Lu, S.T., Zhang, M., Li, Q.N.: Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints. Comput. Optim. Appl. 76(2), 535\u2013569 (2020). https:\/\/doi.org\/10.1007\/s10589-020-00189-9","journal-title":"Comput. Optim. Appl."},{"key":"2616_CR17","unstructured":"Pelckmans, K., Brabanter, J.D., Suykens, J., Moor, B.D.: Convex clustering shrinkage. In: PASCAL Workshop on Statistics and Optimization of Clustering, vol. 1524 (2005)"},{"issue":"1","key":"2616_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/110849523","volume":"34","author":"HD Qi","year":"2013","unstructured":"Qi, H.D.: A semismooth Newton\u2019s method for the nearest Euclidean distance matrix problem. SIAM J. Matrix Anal. Appl. 34(1), 67\u201393 (2013). https:\/\/doi.org\/10.1137\/110849523","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"15","key":"2616_CR19","doi-asserted-by":"publisher","first-page":"3815","DOI":"10.1109\/TSP.2013.2264814","volume":"61","author":"HD Qi","year":"2013","unstructured":"Qi, H.D., Xiu, N.H., Yuan, X.: A Lagrangian dual approach to the single source localization problem. IEEE Trans. Signal Process. 61(15), 3815\u20133826 (2013). https:\/\/doi.org\/10.1109\/TSP.2013.2264814","journal-title":"IEEE Trans. Signal Process."},{"issue":"1\u20132","key":"2616_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-013-0726-0","volume":"147","author":"HD Qi","year":"2014","unstructured":"Qi, H.D., Yuan, X.M.: Computing the nearest Euclidean distance matrix with low embedding dimensions. Math. Program. 147(1\u20132), 351\u2013389 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0726-0","journal-title":"Math. Program."},{"issue":"3","key":"2616_CR21","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1090\/S0002-9947-1938-1501980-0","volume":"44","author":"IJ Schoenberg","year":"1938","unstructured":"Schoenberg, I.J.: Metric spaces and positive definite functions. Trans. Am. Math. Soc. 44(3), 522\u2013536 (1938)","journal-title":"Trans. Am. Math. Soc."},{"issue":"9","key":"2616_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5555\/3546258.3546267","volume":"22","author":"DF Sun","year":"2021","unstructured":"Sun, D.F., Toh, K.C., Yuan, Y.: Convex clustering: model, theoretical guarantee and efficient algorithm. J. Mach. Learn. Res. 22(9), 1\u201332 (2021). https:\/\/doi.org\/10.5555\/3546258.3546267","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2616_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-006-0088-y","volume":"112","author":"KC Toh","year":"2008","unstructured":"Toh, K.C.: An inexact primal-dual path-following algorithm for convex quadratic SDP. Math. Program. 112(1), 221\u2013254 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0088-y","journal-title":"Math. Program."},{"issue":"95","key":"2616_CR24","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.5555\/1756006.1953024","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11(95), 2837\u20132854 (2010). https:\/\/doi.org\/10.5555\/1756006.1953024","journal-title":"J. Mach. Learn. Res."},{"key":"2616_CR25","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17, 395\u2013416 (2007). https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Stat. Comput."},{"key":"2616_CR26","unstructured":"Wang, Z.W., Yuan, Y.C., Ma, J.M., Zeng, T.Y., Sun, D.F.: Randomly projected convex clustering model: Motivation, realization, and cluster recovery guarantees. arXiv preprint arXiv:2303.16841 (2023)"},{"issue":"23","key":"2616_CR27","doi-asserted-by":"publisher","first-page":"14310","DOI":"10.1109\/JSEN.2020.3007701","volume":"20","author":"ZQ Yao","year":"2020","unstructured":"Yao, Z.Q., Dai, Y.J., Li, Q.N., Xie, D., Liu, Z.H.: A novel posture positioning method for multi-joint manipulators. IEEE Sens. J. 20(23), 14310\u201314316 (2020). https:\/\/doi.org\/10.1109\/JSEN.2020.3007701","journal-title":"IEEE Sens. J."},{"key":"2616_CR28","unstructured":"Yuan, Y., Sun, D.F., Toh, K.C.: An efficient semismooth Newton based algorithm for convex clustering. In: Proceedings of the 35th International Conference on Machine Learning, vol.\u00a080, pp. 5718\u20135726 (2018)"},{"issue":"4","key":"2616_CR29","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10898-019-00771-4","volume":"76","author":"FZ Zhai","year":"2020","unstructured":"Zhai, F.Z., Li, Q.N.: A Euclidean distance matrix model for protein molecular conformation. J. Glob. Optim. 76(4), 709\u2013728 (2020). https:\/\/doi.org\/10.1007\/s10898-019-00771-4","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2616_CR30","doi-asserted-by":"publisher","first-page":"4331","DOI":"10.1109\/TSP.2018.2849734","volume":"66","author":"SL Zhou","year":"2018","unstructured":"Zhou, S.L., Xiu, N.H., Qi, H.D.: A fast matrix majorization-projection method for penalized stress minimization with box constraints. IEEE Trans. Signal Process. 66(3), 4331\u20134346 (2018). https:\/\/doi.org\/10.1109\/TSP.2018.2849734","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2616_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TSP.2018.2849734","volume":"12","author":"SL Zhou","year":"2019","unstructured":"Zhou, S.L., Xiu, N.H., Qi, H.D.: Robust Euclidean embedding via EDM optimization. Math. Program. Comput. 12(3), 337\u2013387 (2019). https:\/\/doi.org\/10.1109\/TSP.2018.2849734","journal-title":"Math. Program. Comput."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02616-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02616-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02616-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T08:42:20Z","timestamp":1742373740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02616-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,11]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2616"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02616-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,11]]},"assertion":[{"value":"25 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1"}}