{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:33Z","timestamp":1740122493486,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T00:00:00Z","timestamp":1655251200000},"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 Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01188-2","type":"journal-article","created":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T23:33:08Z","timestamp":1655249588000},"page":"831-855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A facial reduction approach for the single source localization problem"],"prefix":"10.1007","volume":"87","author":[{"given":"He","family":"Shi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1397-6200","authenticated-orcid":false,"given":"Qingna","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,15]]},"reference":[{"issue":"1","key":"1188_CR1","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.laa.2005.10.001","volume":"414","author":"AY Alfakih","year":"2006","unstructured":"Alfakih, A.Y.: A remark on the faces of the cone of Euclidean distance matrices. Linear Algebra Appl. 414(1), 266\u2013270 (2006)","journal-title":"Linear Algebra Appl."},{"key":"1188_CR2","doi-asserted-by":"crossref","unstructured":"Alfakih, A.Y.: Euclidean distance matrices and their applications in rigidity theory, Springer, (2018)","DOI":"10.1007\/978-3-319-97846-8"},{"issue":"1","key":"1188_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1137\/13094918X","volume":"25","author":"S Bai","year":"2015","unstructured":"Bai, S., Qi, H.D., Xiu, N.: Constrained best euclidean distance embedding on a sphere: a matrix optimization approach. SIAM J. Optim. 25(1), 439\u2013467 (2015)","journal-title":"SIAM J. Optim."},{"key":"1188_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0024-3795(81)90310-4","volume":"39","author":"GP Barker","year":"1981","unstructured":"Barker, G.P.: Theory of cones. Linear Algebra Appl. 39, 263\u2013291 (1981)","journal-title":"Linear Algebra Appl."},{"key":"1188_CR5","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, 1770\u20131778 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"1188_CR6","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, 1397\u20131416 (2008)","journal-title":"SIAM J. Optim."},{"key":"1188_CR7","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., Wang, T.C., Ye, Y.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Autom. Sci. Eng. 3, 360\u2013371 (2006)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"1188_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S1446788700017250","volume":"30","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Facial reduction for a cone-convex programming problem. J. Austral. Math. Soc. 30(3), 369\u2013380 (1981)","journal-title":"J. Austral. Math. Soc."},{"issue":"2","key":"1188_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"J Borwein","year":"1981","unstructured":"Borwein, J., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83(2), 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"issue":"5","key":"1188_CR10","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1002\/wcm.72","volume":"2","author":"T Camp","year":"2010","unstructured":"Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing 2(5), 483\u2013502 (2010)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"1188_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1109\/LSP.2008.916731","volume":"15","author":"M Chen","year":"2008","unstructured":"Chen, M., Zhi, D., Dasgupta, S.: A semidefinite programming approach to source localization in wireless sensor networks. IEEE Signal Processing Letters 15, 253\u2013256 (2008)","journal-title":"IEEE Signal Processing Letters"},{"key":"1188_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/ASP\/2006\/20858","volume":"2006","author":"KW Cheung","year":"2006","unstructured":"Cheung, K.W., So, H.C., Ma, W.K., Chan, Y.T.: A constrained least squares approach to mobile positioning: algorithms and optimality. EURASIP J. Adv. Signal Process. 2006, 1\u201323 (2006)","journal-title":"EURASIP J. Adv. Signal Process."},{"key":"1188_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0024-3795(88)90006-7","volume":"105","author":"F Critchley","year":"1988","unstructured":"Critchley, F.: On certain linear mappings between inner-product and squared-distance matrices. Linear Algebra Appl. 105, 91\u2013107 (1988)","journal-title":"Linear Algebra Appl."},{"issue":"30","key":"1188_CR14","doi-asserted-by":"publisher","first-page":"12186","DOI":"10.1073\/pnas.1221464110","volume":"110","author":"I Dokmanic","year":"2013","unstructured":"Dokmanic, I., Parhizkar, R., Walther, A., Lu, Y.M., Vetterli, M.: Acoustic echoes reveal room shape. Proc. Natl. Acad. Sci. 110(30), 12186\u201312191 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"1188_CR15","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."},{"key":"1188_CR16","doi-asserted-by":"crossref","unstructured":"Gartner, G., Ortag, F.: A survey of mobile indoor navigation systems, Cartography in Central and Eastern Europe, Heidelberg, Germany: Springer, 305-319 (2010)","DOI":"10.1007\/978-3-642-03294-3_20"},{"key":"1188_CR17","doi-asserted-by":"crossref","unstructured":"Gaubitch, N., Kleijn, W., Heusdens, R.: Auto-localization in ad-hoc microphone arrays, Proc. IEEE Int. Conf. on Acoust. Speech and Signal Processing, 106-110 (2013)","DOI":"10.1109\/ICASSP.2013.6637618"},{"key":"1188_CR18","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computations. Johns Hopkins University Press, Baltimore (1996)"},{"key":"1188_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0024-3795(87)90307-7","volume":"90","author":"RD Hill","year":"1987","unstructured":"Hill, R.D., Waters, S.R.: On the cone of positive semidefinite matrices. Linear Algebra Appl. 90, 81\u201388 (1987)","journal-title":"Linear Algebra Appl."},{"key":"1188_CR20","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/080713380","volume":"20","author":"S Kim","year":"2009","unstructured":"Kim, S., Kojima, M., Waki, H.: Exploiting sparsity in SDP relaxation for sensor network localization. SIAM J. Optim. 20, 192\u2013215 (2009)","journal-title":"SIAM J. Optim."},{"key":"1188_CR21","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/978-1-4614-0769-0_30","volume-title":"Euclidean distance matrices and applications, In Handbook on semidefinite, conic and polynomial optimization","author":"N Krislock","year":"2012","unstructured":"Krislock, N., Wolkowicz, H.: Euclidean distance matrices and applications, In Handbook on semidefinite, conic and polynomial optimization, pp. 879\u2013914. Springer, Boston, MA (2012)"},{"issue":"2","key":"1188_CR22","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":"2","key":"1188_CR23","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)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1188_CR24","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1007\/s11081-019-09476-9","volume":"21","author":"S Ma","year":"2020","unstructured":"Ma, S., Wang, F., Wei, L., Wolkowicz, H.: Robust principal component analysis using facial reduction. Optim. Eng. 21(3), 1195\u20131219 (2020)","journal-title":"Optim. Eng."},{"issue":"3","key":"1188_CR25","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1109\/TASL.2007.911428","volume":"16","author":"I McCowan","year":"2008","unstructured":"McCowan, I., Lincoln, M., Himawan, I.: Microphone Array Shape Calibration in Diffuse Noise Fields. IEEE Trans. on Audio, Speech, and Language Processing 16(3), 666\u2013670 (2008)","journal-title":"IEEE Trans. on Audio, Speech, and Language Processing"},{"issue":"1","key":"1188_CR26","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 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":"15","key":"1188_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., Yuan, X.: A Lagrangian Dual Approach to the Single-Source Localization Problem. IEEE Tran. Signal Processing 61(15), 3815\u20133826 (2013)","journal-title":"IEEE Tran. Signal Processing"},{"issue":"1\u20132","key":"1188_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.: Computing the nearest Euclidean distance matrix with low embedding dimensions. Math. Program. 147(1\u20132), 351\u2013389 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1188_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02614433","volume":"77","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. 77(2), 129\u2013162 (1997)","journal-title":"Math. Program."},{"key":"1188_CR30","doi-asserted-by":"crossref","unstructured":"Reed, J.D., Buehrer, R.M., da\u00a0Silva, C.R.C.M.: An Optimization Approach to Single-Source Localization Using Direction and Range Estimates, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, (2009)","DOI":"10.1109\/GLOCOM.2009.5425261"},{"key":"1188_CR31","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)"},{"issue":"3","key":"1188_CR32","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 Fr$$\\acute{e} $$chet\u2019s article \u201cSur la d$$\\acute{e} $$finition axiomatique d\u2019une classed\u2019espaces distanci$$\\acute{e} $$s vectoriellement applicable sur l\u2019espace de Hilbert\u2019\u2019. Ann. Math. 36(3), 724\u2013732 (1935)","journal-title":"Ann. Math."},{"issue":"4","key":"1188_CR33","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1007\/s10898-019-00825-7","volume":"75","author":"S Sremac","year":"2019","unstructured":"Sremac, S., Wang, F., Wolkowicz, H., Pettersson, L.: Noisy euclidean distance matrix completion with a single missing node. J. Glob. Optim. 75(4), 973\u20131002 (2019)","journal-title":"J. Glob. Optim."},{"key":"1188_CR34","doi-asserted-by":"crossref","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Method. Softw. 11,625-653 (1999)","DOI":"10.1080\/10556789908805766"},{"issue":"2","key":"1188_CR35","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"AMC So","year":"2007","unstructured":"So, A.M.C., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109(2), 367\u2013384 (2007)","journal-title":"Math. Program."},{"issue":"4","key":"1188_CR36","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"D Sun","year":"2006","unstructured":"Sun, D.: The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31(4), 761\u2013776 (2006)","journal-title":"Math. Oper. Res."},{"key":"1188_CR37","doi-asserted-by":"crossref","unstructured":"Sun, D., Toh, K.C., Yuan, Y., Zhao, X.Y.: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), Optim. Method. Softw. 35(1) (2020) 87-115","DOI":"10.1080\/10556788.2019.1576176"},{"key":"1188_CR38","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0024-3795(94)00031-X","volume":"232","author":"P Tarazaga","year":"1996","unstructured":"Tarazaga, P., Hayden, T.L., Wells, J.: Circum-Euclidean distance matrices and faces. Linear Algebra Appl. 232, 77\u201396 (1996)","journal-title":"Linear Algebra Appl."},{"key":"1188_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2005.03.038","volume":"408","author":"P Tarazaga","year":"2005","unstructured":"Tarazaga, P.: Faces of the cone of Euclidean distance matrices: Characterizations, structure and induced geometry. Linear Algebra Appl. 408, 1\u201313 (2005)","journal-title":"Linear Algebra Appl."},{"key":"1188_CR40","doi-asserted-by":"crossref","unstructured":"T\u00fc t\u00fc nc\u00fc , K. C. Toh, M. J. Todd, Solving semidefinite-quadratic-linear programs using sdpt3, Math. Program., 95(2), 189-217 (2003)","DOI":"10.1007\/s10107-002-0347-5"},{"key":"1188_CR41","doi-asserted-by":"crossref","unstructured":"Vaghefi, R.M., Schloemann, J., Buehrer, R.M.: NLOS mitigation in TOA-based localization using semidefinite programming, In: Positioning Navigation and Communication (WPNC), 1-6 (2013)","DOI":"10.1109\/WPNC.2013.6533288"},{"issue":"1","key":"1188_CR42","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"},{"issue":"16","key":"1188_CR43","doi-asserted-by":"publisher","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. Signal Process. 66(16), 4331\u20134346 (2018)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01188-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01188-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01188-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T19:55:45Z","timestamp":1698782145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01188-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,15]]},"references-count":43,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1188"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01188-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,6,15]]},"assertion":[{"value":"30 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}