{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T11:40:27Z","timestamp":1699875627645},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671036"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10589-020-00189-9","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T19:02:22Z","timestamp":1588014142000},"page":"535-569","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints"],"prefix":"10.1007","volume":"76","author":[{"given":"Si-Tong","family":"Lu","sequence":"first","affiliation":[]},{"given":"Miao","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1749-5807","authenticated-orcid":false,"given":"Qing-Na","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,27]]},"reference":[{"issue":"C","key":"189_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. Digital Signal Process. 55(C), 85\u201397 (2016)","journal-title":"Digital Signal Process."},{"key":"189_CR2","volume-title":"Statistical Inference Under Order Restrictions: The Theory and Application of Isotonic Regression","author":"RE Barlow","year":"1973","unstructured":"Barlow, R.E., Bartholomew, D.J., Bremner, J.M., Brunk, H.D.: Statistical Inference Under Order Restrictions: The Theory and Application of Isotonic Regression. Wiley, New York (1973)"},{"issue":"1","key":"189_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z.K., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucl. Acids Res. 28(1), 235\u2013242 (2000)","journal-title":"Nucl. Acids Res."},{"issue":"4","key":"189_CR4","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)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"189_CR5","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pp. 46\u201354 (2004)","DOI":"10.1145\/984622.984630"},{"issue":"3","key":"189_CR6","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1214\/15-AOAS842","volume":"9","author":"M Bogdan","year":"2015","unstructured":"Bogdan, M., Van, D.B.E., Sabatti, C., Su, W., Cand\u00e8s, E.J.: SLOPE-adaptive variable selection via convex optimization. Ann. Appl. Stat. 9(3), 1103\u20131140 (2015)","journal-title":"Ann. Appl. Stat."},{"issue":"3","key":"189_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/j.1745-3984.2003.tb01108.x","volume":"40","author":"I Borg","year":"2010","unstructured":"Borg, I., Groenen, P.: Modern multidimensional scaling: theory and applications. J. Educ. Meas. 40(3), 277\u2013280 (2010)","journal-title":"J. Educ. Meas."},{"key":"189_CR8","volume-title":"Modern Multidensional Scaling","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidensional Scaling. Springer, Berlin (2005)"},{"key":"189_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/9781420036121","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2000","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman and Hall\/CRC, London (2000)"},{"key":"189_CR10","volume-title":"Convex Optimization and Euclidean Distance Geometry","author":"J Dattorro","year":"2005","unstructured":"Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Meboo, Mountain View (2005)"},{"key":"189_CR11","unstructured":"De Leeuw, J.: Applications of convex analysis to multidimensional scaling. Recent Developments in Statistics, pp. 133\u2013146 (2011)"},{"issue":"3","key":"189_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v031.i03","volume":"31","author":"J De Leeuw","year":"2009","unstructured":"De Leeuw, J., Mair, P.: Multidimensional scaling using majorization: SMACOF in R. J. Stat. Softw. 31(3), 1\u201330 (2009)","journal-title":"J. Stat. Softw."},{"issue":"1","key":"189_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10589-016-9858-5","volume":"66","author":"C Ding","year":"2017","unstructured":"Ding, C., Qi, H.D.: Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation. Comput. Optim. Appl. 66(1), 187\u2013218 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"189_CR14","volume-title":"The Semiregular Polytopes of the Hyperspaces","author":"EL Elte","year":"1912","unstructured":"Elte, E.L.: The Semiregular Polytopes of the Hyperspaces. Hoitsema, Groningen (1912)"},{"key":"189_CR15","doi-asserted-by":"crossref","unstructured":"Fang, X.Y., Toh, K.C.: Using a distributed SDP approach to solve simulated protein molecular conformation problems. In: Distance Geometry, pp. 351\u2013376. Springer (2013)","DOI":"10.1007\/978-1-4614-5128-0_17"},{"issue":"3","key":"189_CR16","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080727075","volume":"31","author":"Y Gao","year":"2009","unstructured":"Gao, Y., Sun, D.F.: Calibrating least squares covariance matrix problems with equality and inequality constraints. SIAM J. Matrix Anal. 31(3), 1432\u20131457 (2009)","journal-title":"SIAM J. Matrix Anal."},{"issue":"1","key":"189_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/jcc.540140115","volume":"14","author":"W Glunt","year":"1993","unstructured":"Glunt, W., Hayden, T.L., Raydan, M.: Molecular conformations from distance matrices. J. Comput. Chem. 14(1), 114\u2013120 (1993)","journal-title":"J. Comput. Chem."},{"issue":"none","key":"189_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0024-3795(85)90187-9","volume":"67","author":"JC Gower","year":"1985","unstructured":"Gower, J.C.: Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra Appl. 67(none), 81\u201397 (1985)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"189_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29(1), 1\u201327 (1964)","journal-title":"Psychometrika"},{"issue":"2","key":"189_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02289694","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Nonmetric multidimensional scaling: a numerical method. Psychometrika 29(2), 115\u2013129 (1964)","journal-title":"Psychometrika"},{"issue":"6","key":"189_CR21","doi-asserted-by":"publisher","first-page":"4351","DOI":"10.1137\/080733103","volume":"31","author":"N Leung","year":"2009","unstructured":"Leung, N., Hang, Z., Toh, K.C.: An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization. SIAM J. Sci. Comput. 31(6), 4351\u20134372 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"189_CR22","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)","journal-title":"J. Comput. Math."},{"issue":"1","key":"189_CR23","first-page":"3","volume":"56","author":"L Liberti","year":"2012","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. Quant. Biol. 56(1), 3\u201369 (2012)","journal-title":"Quant. Biol."},{"key":"189_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I. Springer, Berlin (2006)"},{"issue":"34","key":"189_CR25","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(34), 67\u201393 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"189_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s40305-014-0048-9","volume":"2","author":"HD Qi","year":"2014","unstructured":"Qi, H.D.: Conditional quadratic semidefinite programming: examples and methods. J. Oper. Res. Soc. China 2(2), 143\u2013170 (2014)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"15","key":"189_CR27","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.M.: A Lagrangian dual approach to the single-source localization problem. IEEE Trans. Signal Process. 61(15), 3815\u20133826 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1\u20132","key":"189_CR28","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)","journal-title":"Math. Program."},{"key":"189_CR29","unstructured":"Rosman, G., Bronstein, A.M., Bronstein, M.M., Sidi, A., Kimmel, R.: Fast multidimensional scaling using vector extrapolation. Technical report, Computer Science Department, Technion, (2008)"},{"issue":"3","key":"189_CR30","doi-asserted-by":"publisher","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"IJ Schoenberg","year":"1935","unstructured":"Schoenberg, I.J.: Remarks to maurice frechet\u2019s article \u201csur la definition axiomatique d\u2019une classe d\u2019espace distances vectoriellement applicable sur l\u2019espace de hilbert. Ann. Math. 36(3), 724\u2013732 (1935)","journal-title":"Ann. Math."},{"issue":"1","key":"189_CR31","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)","journal-title":"Math. Program."},{"issue":"4","key":"189_CR32","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson, W.S.: Multidimensional scaling: I. Theory and method. Psychometrika 17(4), 401\u2013419 (1952)","journal-title":"Psychometrika"},{"issue":"1","key":"189_CR33","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02287916","volume":"3","author":"G Young","year":"1938","unstructured":"Young, G., Householder, A.S.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3(1), 19\u201322 (1938)","journal-title":"Psychometrika"},{"key":"189_CR34","doi-asserted-by":"crossref","unstructured":"Zhai, F.Z., Li, Q.N.: A Euclidean distance matrix model for protein molecular conformation. J. Global Optim. (2019)","DOI":"10.1007\/s10898-019-00771-4"},{"issue":"3","key":"189_CR35","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 constrained stress minimization in MDS. IEEE Trans. Signal Process. 66(3), 4331\u20134346 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"189_CR36","doi-asserted-by":"crossref","unstructured":"Zhou, S.L., Xiu, N.H., Qi, H.D.: Robust Euclidean embedding via EDM optimization. Math. Program. Comput. (2019)","DOI":"10.1007\/s12532-019-00168-0"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00189-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00189-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00189-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T00:24:26Z","timestamp":1619483066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00189-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,27]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00189-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,27]]},"assertion":[{"value":"9 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}