{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:20:51Z","timestamp":1773656451231,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T00:00:00Z","timestamp":1689033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T00:00:00Z","timestamp":1689033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000288","name":"The Royal Society","doi-asserted-by":"crossref","award":["IECNSF191543"],"award-info":[{"award-number":["IECNSF191543"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801057"],"award-info":[{"award-number":["11801057"]}],"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":[[2023,12]]},"DOI":"10.1007\/s10589-023-00505-z","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T05:01:40Z","timestamp":1689051700000},"page":"1193-1227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications"],"prefix":"10.1007","volume":"86","author":[{"given":"Shaoyan","family":"Guo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3481-4814","authenticated-orcid":false,"given":"Hou-Duo","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Liwei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,11]]},"reference":[{"key":"505_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1008655427845","volume":"12","author":"AY Alfakih","year":"1999","unstructured":"Alfakih, A.Y., Khandani, A., Wolkowicz, H.: Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12, 13\u201330 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"505_CR2","series-title":"International Series in Operations Research and Management Science","first-page":"533","volume-title":"Handbook of Semidefinite programminP","author":"AY Alfakih","year":"2002","unstructured":"Alfakih, A.Y., Wolkowicz, H.: Matrix completion problems. In: Handbook of Semidefinite programminP. International Series in Operations Research and Management Science, vol. 27, pp. 533\u2013545. Kluwer Academic Publication, Boston (2002)"},{"key":"505_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.laa.2005.03.021","volume":"406","author":"S Al-Homidan","year":"2005","unstructured":"Al-Homidan, S., Wolkowicz, H.: Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming. Linear Algebra Appl. 406, 109\u2013141 (2005)","journal-title":"Linear Algebra Appl."},{"key":"505_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"},{"key":"505_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10107-005-0613-4","volume":"104","author":"JF Bonnans","year":"2005","unstructured":"Bonnans, J.F., Ramirez, C.H.: Perturbation analysis of second-order cone programming problems. Math. Program. Ser. B 104, 205\u2013227 (2005)","journal-title":"Math. Program. Ser. B"},{"key":"505_CR6","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling: Theory and Applications, 2nd edn. Springer Ser. Statist, Springer, New York (2005)","edition":"2"},{"key":"505_CR7","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1137\/070681235","volume":"19","author":"ZX Chan","year":"2008","unstructured":"Chan, Z.X., Sun, D.F.: Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming. SIAM J. Optim. 19, 370\u2013396 (2008)","journal-title":"SIAM J. Optim."},{"key":"505_CR8","volume-title":"Convex Optimization and Euclidean Distance Geometry","author":"J Dattorro","year":"2005","unstructured":"Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Meboo Publishing USA, Palo Alto, CA (2005)"},{"key":"505_CR9","doi-asserted-by":"crossref","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, 341\u2013381 (2017)","journal-title":"Math. Program."},{"key":"505_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0619-7","volume":"144","author":"C Ding","year":"2014","unstructured":"Ding, C., Sun, D.F., Toh, K.C.: An introduction to a class of matrix cone programming. Maths. Prog. 144, 141\u2013179 (2014)","journal-title":"Maths. Prog."},{"key":"505_CR11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/16M1058753","volume":"27","author":"C Ding","year":"2017","unstructured":"Ding, C., Sun, D.F., Zhang, L.W.: Characterization of the robust isolated calmness for a class of conic programming problems. SIAM J. Optim. 27, 67\u201390 (2017)","journal-title":"SIAM J. Optim."},{"key":"505_CR12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MSP.2015.2398954","volume":"32","author":"I Dokmanic","year":"2015","unstructured":"Dokmanic, I., Parhizkar, R., Ranieri, J., Vetterli, M.: Euclidean distance matrices: essential theory, algorithms, and applications. IEEE Signal Process. Mag. 32, 12\u201330 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"505_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-87821-8","volume-title":"Implicit Functions and Solution Mappings","author":"AL Dontchev","year":"2009","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings. Springer, New York (2009)"},{"key":"505_CR14","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1137\/15M103710X","volume":"27","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Krislock, N., Voronin, T.-L., Wolkowicz, H.: Noisy Euclidean distance realization: robust facial reduction and the pareto frontier. SIAM J. Optim. 27, 2301\u20132331 (2017)","journal-title":"SIAM J. Optim."},{"key":"505_CR15","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer, New York (2003)"},{"key":"505_CR16","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel, M., Pong, T.K., Sun, D., Tseng, P.: Hankel matrix rank mininization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34, 946\u2013977 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"505_CR17","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/0611042","volume":"11","author":"W Glunt","year":"1990","unstructured":"Glunt, W., Hayden, T.L., Hong, S., Wells, J.: An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11, 589\u2013600 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"505_CR18","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02614077","volume":"36","author":"N Gaffke","year":"1989","unstructured":"Gaffke, N., Mathar, R.: A cyclic projection algorithm via duality. Metrika 36, 29\u201354 (1989)","journal-title":"Metrika"},{"key":"505_CR19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0024-3795(88)90202-9","volume":"109","author":"TL Hayden","year":"1988","unstructured":"Hayden, T.L., Wells, J.: Approximation by matrices positive semidefinite on a subspace. Linear Algebra Appl. 109, 115\u2013130 (1988)","journal-title":"Linear Algebra Appl."},{"key":"505_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1018363021404","volume":"9","author":"CR Johnson","year":"1998","unstructured":"Johnson, C.R., Kroschel, B., Wolkowicz, H.: An interior-point method for approximate positive semidefinite completion. Comput. Optim. Appl. 9, 175\u2013190 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"505_CR21","volume-title":"Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications","author":"D Klatte","year":"2002","unstructured":"Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications. Kluwer Academic Publishers, Boston (2002)"},{"key":"505_CR22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/B978-0-12-590240-3.50009-4","volume-title":"Analysis and Computation of Fixed Points","author":"M Kojima","year":"1980","unstructured":"Kojima, M.: Strongly stable stationary solutions in nonlinear programs. In: Analysis and Computation of Fixed Points, pp. 93\u2013138. Academic Press, New York (1980)"},{"key":"505_CR23","doi-asserted-by":"crossref","first-page":"2679","DOI":"10.1137\/090759392","volume":"20","author":"N Krislock","year":"2010","unstructured":"Krislock, N., Wolkowicz, H.: Explicit sensor network localization using semidefinite representations and facial reductions. SIAM J. Optim. 20, 2679\u20132708 (2010)","journal-title":"SIAM J. Optim."},{"key":"505_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56, 3\u201369 (2014)","journal-title":"SIAM Rev."},{"key":"505_CR25","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01893414","volume":"2","author":"CA Micchelli","year":"1986","unstructured":"Micchelli, C.A.: Interpolation of scattered data: distance matrices and conditionally positive definite functions. Constr. Approx. 2, 11\u201322 (1986)","journal-title":"Constr. Approx."},{"key":"505_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-92775-6","volume-title":"Variational Analysis and Applications","author":"BS Mordukhovich","year":"2018","unstructured":"Mordukhovich, B.S.: Variational Analysis and Applications. Springer, New York (2018)"},{"key":"505_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/110849523","volume":"34","author":"HD Qi","year":"2013","unstructured":"Qi, H.D.: A semismooth Newton method for the nearest Euclidean distance matrix problem. SIAM J. Matrix Anal. Appl. 34, 67\u201393 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"505_CR28","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s40305-014-0048-9","volume":"2","author":"H-D Qi","year":"2014","unstructured":"Qi, H.-D.: Conditional quadratic semidefinite programming: examples and methods. J. Oper. Res. Soc. China 2, 143\u2013170 (2014)","journal-title":"J. Oper. Res. Soc. China"},{"key":"505_CR29","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-013-0726-0","volume":"147","author":"H-D Qi","year":"2014","unstructured":"Qi, H.-D., Yuan, X.: Computing the nearest Euclidean distance matrix with low embedding dimensions. Math. Prog. 147, 351\u2013389 (2014)","journal-title":"Math. Prog."},{"key":"505_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9781118673539","volume-title":"Volatility and Correlation","author":"R Rebonato","year":"2004","unstructured":"Rebonato, R.: Volatility and Correlation, 2nd edn. Wiley, New Jersey (2004)","edition":"2"},{"key":"505_CR31","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.5.1.43","volume":"5","author":"SM Robinson","year":"1980","unstructured":"Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43\u201362 (1980)","journal-title":"Math. Oper. Res."},{"key":"505_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.-B.: Variational Analysis. Springer Verlag, Berlin (1998)"},{"key":"505_CR33","doi-asserted-by":"crossref","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"IJ Schoenberg","year":"1935","unstructured":"Schoenberg, I.J.: Remarks to Maurice Frech\u00e9t\u2019s article \u201cSur la d\u00e9finition axiomatique d\u2019une classe d\u2019espace distanc\u00e9s vectoriellement applicable sur l\u2019espace de Hilbert\u2019\u2019. Ann. Math. 36, 724\u2013732 (1935)","journal-title":"Ann. Math."},{"key":"505_CR34","first-page":"301","volume":"77","author":"A Shapiro","year":"1997","unstructured":"Shapiro, A.: First and second order analysis of nonlinear semidefinite programs. Math. Prog. 77, 301\u2013320 (1997)","journal-title":"Math. Prog."},{"key":"505_CR35","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"DF Sun","year":"2006","unstructured":"Sun, D.F.: The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31, 761\u2013776 (2006)","journal-title":"Math. Oper. Res."},{"key":"505_CR36","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.27.1.150.342","volume":"27","author":"DF Sun","year":"2002","unstructured":"Sun, D.F., Sun, J.: Semismooth matrix valued functions. Math. Oper. Res. 27, 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"key":"505_CR37","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1137\/S0036144504443821","volume":"48","author":"J Sun","year":"2006","unstructured":"Sun, J., Boyd, S., Xiao, L., Diaconis, P.: The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Rev. 48, 681\u2013699 (2006)","journal-title":"SIAM Rev."},{"key":"505_CR38","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1007\/s11425-009-0207-3","volume":"53","author":"Y Wang","year":"2010","unstructured":"Wang, Y., Zhang, L.W.: Nonsingularity in second-order cone programming via the smoothing metric projector. Sci. China Math. 53, 1025\u20131038 (2010)","journal-title":"Sci. China Math."},{"key":"505_CR39","first-page":"1683","volume":"6","author":"KQ Weinberger","year":"2006","unstructured":"Weinberger, K.Q., Lawrence, K.S.: An introduction to nonlinear dimensionality reduction by maximum variance unfolding. AAAI 6, 1683\u20131686 (2006)","journal-title":"AAAI"},{"key":"505_CR40","doi-asserted-by":"crossref","first-page":"2196","DOI":"10.1109\/TSP.2019.2904022","volume":"67","author":"H Zhang","year":"2019","unstructured":"Zhang, H., Liu, Y., Lei, H.: Localization from incomplete Euclidean distance matrix: performance analysis for the svd-mds approach. IEEE Trans. Sig. Process. 67, 2196\u20132209 (2019)","journal-title":"IEEE Trans. Sig. Process."},{"key":"505_CR41","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10589-021-00279-2","volume":"79","author":"Q Zhang","year":"2021","unstructured":"Zhang, Q., Zhao, X., Ding, C.: Matrix optimization based Euclidean embedding with outliers. Comput. Optim. Appl. 79, 235\u2013271 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"505_CR42","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s12532-019-00168-0","volume":"12","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Xiu, N., Qi, H.-D.: Robust Euclidean embedding via EDM optimization. Math. Prog. Comput. 12, 337\u2013387 (2020)","journal-title":"Math. Prog. Comput."},{"key":"505_CR43","doi-asserted-by":"crossref","first-page":"4331","DOI":"10.1109\/TSP.2018.2849734","volume":"66","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Xiu, N., Qi, H.-D.: A fast matrix majorization-projection method for penalized stress minimization with box constraints. IEEE Trans. Sig. Process. 66, 4331\u20134346 (2018)","journal-title":"IEEE Trans. Sig. Process."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00505-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00505-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00505-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T12:13:50Z","timestamp":1699877630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00505-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,11]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["505"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00505-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,11]]},"assertion":[{"value":"8 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. Furthermore, the authors have no competing or conflict of interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}