{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T09:29:17Z","timestamp":1743845357727,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000038","name":"National Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["1"],"award-info":[{"award-number":["1"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10898-019-00825-7","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T07:02:42Z","timestamp":1566802962000},"page":"973-1002","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Noisy Euclidean distance matrix completion with a single missing node"],"prefix":"10.1007","volume":"75","author":[{"given":"Stefan","family":"Sremac","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8978-5649","authenticated-orcid":false,"given":"Fei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[]},{"given":"Lucas","family":"Pettersson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"key":"825_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97846-8","volume-title":"Euclidean Distance Matrices and Their Applications in Rigidity Theory","author":"AY Alfakih","year":"2018","unstructured":"Alfakih, A.Y.: Euclidean Distance Matrices and Their Applications in Rigidity Theory. Springer, Cham (2018)"},{"issue":"1\u20133","key":"825_CR2","doi-asserted-by":"publisher","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(1\u20133), 13\u201330 (1999). A tribute to Olvi Mangasarian","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"825_CR3","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/TSP.2007.909342","volume":"56","author":"A Beck","year":"2008","unstructured":"Beck, A., Stoica, P., Li, J.: Exact and approximate solutions of source localization problems. IEEE Trans. Signal Process. 56(5), 1770\u20131778 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"825_CR4","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1137\/070698014","volume":"19","author":"A Beck","year":"2008","unstructured":"Beck, A., Teboulle, M., Chikishev, Z.: Iterative minimization schemes for solving the single source localization problem. SIAM J. Optim. 19(3), 1397\u20131416 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"825_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/j.1745-3984.2003.tb01108.x","volume":"40","author":"I Borg","year":"2003","unstructured":"Borg, I., Groenen, P.: Modern multidimensional scaling: theory and applications. J. Educ. Meas. 40(3), 277\u2013280 (2003)","journal-title":"J. Educ. Meas."},{"key":"825_CR6","doi-asserted-by":"crossref","unstructured":"Candes, E., Rudelson, M., Tao, T., Vershynin, R.: Error correction via linear programming. In: Proceedings of HTE 2005 46th Annual EIII Symposium on Foundations of Computer Science, (FOCS\u2019o5), pp. 1\u201314. IEEE, New York (2005)","DOI":"10.1109\/SFCS.2005.5464411"},{"issue":"8","key":"825_CR7","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"825_CR8","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1109\/TSP.2004.823465","volume":"52","author":"KW Cheung","year":"2004","unstructured":"Cheung, K.W., So, H.-C., Ma, W.-K., Chan, Y.-T.: Least squares algorithms for time-of-arrival-based mobile location. IEEE Trans. Signal Process. 52(4), 1121\u20131130 (2004)","journal-title":"IEEE Trans. Signal Process."},{"key":"825_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.: Multidimensional Scaling. Chapman and hall\/CRC, Boca Raton (2000)"},{"key":"825_CR10","volume-title":"Distance Geometry and Molecular Conformation","author":"GM Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation, vol. 74. Research Studies Press Taunton, Taunton (1988)"},{"key":"825_CR11","unstructured":"Critchley, F.: Dimensionality theorems in multidimensional scaling and hierarchical cluster analysis. In: Data Analysis and Informatics (Versailles, 1985), pp. 45\u201370. North-Holland, Amsterdam (1986)"},{"key":"825_CR12","unstructured":"Dattorro, J.: Convex optimization & Euclidean distance geometry. Lulu. com (2010)"},{"issue":"1","key":"825_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s11081-008-9072-0","volume":"11","author":"Y Ding","year":"2010","unstructured":"Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, Euclidean distance matrix completions, and graph realization. Optim. Eng. 11(1), 45\u201366 (2010)","journal-title":"Optim. Eng."},{"issue":"2, Ser. A","key":"825_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2, Ser. A), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"825_CR15","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1137\/15M103710X","volume":"27","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Krislock, N., Cheung Voronin, Y.-L., Wolkowicz, H.: Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier. SIAM J. Optim. 27(4), 2301\u20132331 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"825_CR16","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1137\/140968318","volume":"25","author":"D Drusvyatskiy","year":"2015","unstructured":"Drusvyatskiy, D., Pataki, G., Wolkowicz, H.: Coordinate shadows of semidefinite and Euclidean distance matrices. SIAM J. Optim. 25(2), 1160\u20131178 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"825_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1561\/2400000011","volume":"3","author":"Dmitriy Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Wolkowicz, H.: The many faces of degeneracy in conic optimization. Found. Trends\u00ae Optim. 3(2), 77\u2013170 (2017)","journal-title":"Foundations and Trends\u00ae in Optimization"},{"issue":"4\u20135","key":"825_CR18","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1080\/10556788.2011.643888","volume":"27","author":"H Fang","year":"2012","unstructured":"Fang, H., O\u2019Leary, D.P.: Euclidean distance matrix completion problems. Optim. Methods Softw. 27(4\u20135), 695\u2013717 (2012)","journal-title":"Optim. Methods Softw."},{"key":"825_CR19","unstructured":"Gao, Y., Sun, D.: A majorized penalty approach for calibrating rank constrained correlation matrix problems. Technical Report (2010)"},{"key":"825_CR20","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"825_CR21","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, 81\u201397 (1985)","journal-title":"Linear Algebra Appl."},{"key":"825_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0024-3795(91)90068-8","volume":"144","author":"TL Hayden","year":"1991","unstructured":"Hayden, T.L., Wells, J., Liu, W.M., Tarazaga, P.: The cone of distance matrices. Linear Algebra Appl. 144, 153\u2013169 (1991)","journal-title":"Linear Algebra Appl."},{"key":"825_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis, Grundlehren Text Editions","author":"J-B Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis, Grundlehren Text Editions. Springer, Berlin (2001). Abridged version of it Convex analysis and minimization algorithms. I [Springer, Berlin, 1993; MR1261420 (95m:90001)] and it II [ibid.; MR1295240 (95m:90002)]"},{"issue":"2","key":"825_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/6.819928","volume":"37","author":"H Koshima","year":"2000","unstructured":"Koshima, H., Hoshen, J.: Personal locator services emerge. IEEE Spectr. 37(2), 41\u201348 (2000)","journal-title":"IEEE Spectr."},{"key":"825_CR25","doi-asserted-by":"crossref","unstructured":"Krislock, N., Wolkowicz, H.: Euclidean distance matrices and applications. In: Handbook on Semidefinite, Cone and Polynomial Optimization, Number 2009-06 in International Series in Operations Research & Management Science, pp. 879\u2013914. Springer, Berlin (2011)","DOI":"10.1007\/978-1-4614-0769-0_30"},{"issue":"1","key":"825_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ultras.2013.06.009","volume":"54","author":"T Kundu","year":"2014","unstructured":"Kundu, T.: Acoustic source localization. Ultrasonics 54(1), 25\u201338 (2014)","journal-title":"Ultrasonics"},{"issue":"1","key":"825_CR27","doi-asserted-by":"publisher","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(1), 3\u201369 (2014)","journal-title":"SIAM Rev."},{"issue":"2","key":"825_CR28","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2), 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"825_CR29","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10589-013-9635-7","volume":"58","author":"TK Pong","year":"2014","unstructured":"Pong, T.K., Wolkowicz, H.: The generalized trust region subproblem. Comput. Optim. Appl. 58(2), 273\u2013322 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"825_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/110849523","volume":"34","author":"H-D Qi","year":"2013","unstructured":"Qi, H.-D.: A semismooth Newton method for the nearest Euclidean distance matrix problem. SIAM J. Matrix Anal. Appl. 34(1), 67\u201393 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"825_CR31","doi-asserted-by":"publisher","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. Program. 147(1), 351\u2013389 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"825_CR32","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":"3","key":"825_CR33","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/S0895479891199719","volume":"15","author":"R Stern","year":"1994","unstructured":"Stern, R., Wolkowicz, H.: Trust region problems and nonsymmetric eigenvalue perturbations. SIAM J. Matrix Anal. Appl. 15(3), 755\u2013778 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"825_CR34","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1137\/0805016","volume":"5","author":"R Stern","year":"1995","unstructured":"Stern, R., Wolkowicz, H.: Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Optim. 5(2), 286\u2013313 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"825_CR35","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., An, L.T.H.: Convex analysis approach to dc programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"1\u20134","key":"825_CR36","first-page":"23","volume":"133","author":"PD Tao","year":"2005","unstructured":"Tao, P.D., An, L.T.H.: The dc (difference of convex functions) programming and dca revisited with dc models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1\u20134), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"825_CR37","doi-asserted-by":"crossref","unstructured":"Tun\u00e7el, L.: Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization. Fields Institute Monographs, vol. 27. American Mathematical Society, Providence, RI (2010)","DOI":"10.1090\/fim\/027"},{"issue":"7","key":"825_CR38","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSPEC.2003.1209608","volume":"40","author":"J Warrior","year":"2003","unstructured":"Warrior, J., McHenry, E., McGee, K.: They know where you are [location detection]. IEEE Spectr. 40(7), 20\u201325 (2003)","journal-title":"IEEE Spectr."},{"volume-title":"Handbook of Semidefinite Programming. International Series in Operations Research & Management Science","year":"2000","key":"825_CR39","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. International Series in Operations Research & Management Science, vol. 27. Kluwer Academic Publishers, Boston, MA (2000)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00825-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00825-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00825-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T23:11:33Z","timestamp":1598310693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00825-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,26]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["825"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00825-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,8,26]]},"assertion":[{"value":"28 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}