{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T18:52:50Z","timestamp":1784919170576,"version":"3.55.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1023\/a:1008655427845","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"13-30","source":"Crossref","is-referenced-by-count":165,"title":["Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming"],"prefix":"10.1007","volume":"12","author":[{"given":"Abdo Y.","family":"Alfakih","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amir","family":"Khandani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"190478_CR1","unstructured":"A. Alfakih and H. Wolkowicz, \u201cOn the embeddability of weighted graphs in Euclidean spaces,\u201d Technical Report CORR Report 98\u201312, University of Waterloo, 1998. Submitted-URL: ftp:\/\/orion.uwaterloo.ca\/pub\/henry\/reports\/embedEDM.ps.gz."},{"key":"190478_CR2","unstructured":"S. Al-Homidan, \u201cHybrid methods for optimization problems with positive semidefinite matrix constraints,\u201d Ph.D. Thesis, University of Dundee, 1993."},{"key":"190478_CR3","first-page":"1","volume-title":"Recent Advances in Nonsmooth Optimization","author":"S. Al-Homidan","year":"1995","unstructured":"S. Al-Homidan and R. Fletcher, \u201cHybrid methods for finding the nearest Euclidean distance matrix,\u201d in Recent Advances in Nonsmooth Optimization, World Sci. Publishing River Edge, NJ, 1995, pp. 1\u201317."},{"key":"190478_CR4","unstructured":"F. Alizadeh, \u201cCombinatorial optimization with interior point methods and semidefinite matrices,\u201d Ph.D. Thesis, University of Minnesota, 1991."},{"key":"190478_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh, \u201cInterior point methods in semidefinite programming with applications to combinatorial optimization,\u201d SIAM Journal on Optimization, vol. 5, pp. 13\u201351, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"190478_CR6","series-title":"Technical Report","volume-title":"Sdppack user's guide\u2014version 0.8 beta","author":"F. Alizadeh","year":"1997","unstructured":"F. Alizadeh, J.-P. Haeberly, M.V. Nayakkankuppam, and M.L. Overton, \u201cSdppack user's guide\u2014version 0.8 beta,\u201d Technical Report TR1997\u2013734, Courant Institute of Mathematical Sciences, NYU, New York, March 1997."},{"issue":"2","key":"190478_CR7","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/S0895479893249757","volume":"16","author":"M. Bakonyi","year":"1995","unstructured":"M. Bakonyi and C.R. Johnson, \u201cThe Euclidean distance matrix completion problem,\u201d SIAM J. Matrix Anal. Appl., vol. 16,no. 2, pp. 646\u2013654, 1995.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"190478_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107325708","volume-title":"Combinatorial Matrix Theory","author":"R.A. Brualdi","year":"1991","unstructured":"R.A. Brualdi and H.J. Ryser, Combinatorial Matrix Theory, Cambridge University Press: New York, 1991."},{"key":"190478_CR9","volume-title":"Distance Geometry and Molecular Conformation","author":"G.M. Crippen","year":"1988","unstructured":"G.M. Crippen and T.F. Havel, Distance Geometry and Molecular Conformation, Wiley: New York, 1988."},{"key":"190478_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0024-3795(88)90006-7","volume":"105","author":"F. Critchley","year":"1988","unstructured":"F. Critchley, \u201cOn certain linear mappings between inner-product and squared distance matrices.\u201d Linear Algebra Appl., vol. 105, pp. 91\u2013107, 1988.","journal-title":"Linear Algebra Appl."},{"key":"190478_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0024-3795(87)90024-3","volume":"95","author":"R.W. Farebrother","year":"1987","unstructured":"R.W. Farebrother, \u201cThree theorems with applications to Euclidean distance matrices,\u201d Linear Algebra Appl., vol. 95, pp. 11\u201316, 1987.","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"190478_CR12","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1137\/0611042","volume":"11","author":"W. Glunt","year":"1990","unstructured":"W. Glunt, T.L. Hayden, S. Hong, and J. Wells, \u201cAn alternating projection algorithm for computing the nearest Euclidean distance matrix.\u201d SIAM J. Matrix Anal. Appl., vol. 11,no. 4, pp. 589\u2013600, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"190478_CR13","first-page":"143","volume":"79","author":"M.X. Goemans","year":"1997","unstructured":"M.X. Goemans, \u201cSemidefinite programming in combinatorial optimization,\u201d Mathematical Programmings, vol. 79, pp. 143\u2013162, 1997.","journal-title":"Mathematical Programmings"},{"key":"190478_CR14","volume-title":"Theory of Convex Programming","author":"E.G. Gol'stein","year":"1972","unstructured":"E.G. Gol'stein, Theory of Convex Programming, American Mathematical Society: Providence, RI, 1972."},{"key":"190478_CR15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0024-3795(85)90187-9","volume":"67","author":"J.C. Gower","year":"1985","unstructured":"J.C. Gower, \u201cProperties of Euclidean and non-Euclidean distance matrices,\u201d Linear Algebra Appl., vol. 67, pp. 81\u201397, 1985.","journal-title":"Linear Algebra Appl."},{"key":"190478_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0024-3795(91)90068-8","volume":"144","author":"T.L. Hayden","year":"1991","unstructured":"T.L. Hayden, J. Wells, W-M. Liu, and P. Tarazaga, \u201cThe cone of distance matrices,\u201d Linear Algebra Appl., vol. 144, pp. 153\u2013169, 1991.","journal-title":"Linear Algebra Appl."},{"key":"190478_CR17","volume-title":"An interior point method for semidefinite programming and max-cut bounds","author":"C. Helmberg","year":"1994","unstructured":"C. Helmberg, \u201cAn interior point method for semidefinite programming and max-cut bounds,\u201d Ph.D. Thesis, Graz University of Technology, Austria, 1994."},{"key":"190478_CR18","doi-asserted-by":"crossref","unstructured":"C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz, \u201cAn interior point method for semidefinite programming,\u201d SIAM Journal on Optimization, pp. 342\u2013361, 1996. URL: ftp:\/\/orion.uwaterloo.ca\/pub\/henry\/reports\/sdp.ps.gz.","DOI":"10.1137\/0806020"},{"key":"190478_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press: New York, 1985."},{"issue":"2","key":"190478_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1018363021404","volume":"9","author":"C. Johnson","year":"1998","unstructured":"C. Johnson, B. Kroschel, and H. Wolkowicz, \u201cAn interior-point method for approximate positive semidefinite completions,\u201d Computational Optimization and Applications, vol. 9,no. 2, pp. 175\u2013190, 1998.","journal-title":"Computational Optimization and Applications"},{"key":"190478_CR21","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0024-3795(95)00096-A","volume":"223\/224","author":"C.R. Johnson","year":"1995","unstructured":"C.R. Johnson and P. Tarazaga, \u201cConnections between the real positive semidefinite and distance matrix completion problems,\u201d Linear Algebra Appl., vol. 223\/224, pp. 375\u2013391, 1995.","journal-title":"Linear Algebra Appl."},{"key":"190478_CR22","unstructured":"E. De Klerk, \u201cInterior point methods for semidefinite programming,\u201d Ph.D. Thesis, Delft University, 1997."},{"key":"190478_CR23","series-title":"Technical Report","volume-title":"The Gauss-Newton direction in linear and semidefinite programming","author":"S. Kruk","year":"1998","unstructured":"S. Kruk, M. Muramatsu, F. Rendl, R.J. Vanderbei, and H. Wolkowicz, \u201cThe Gauss-Newton direction in linear and semidefinite programming,\u201d Technical Report CORR 98\u201316, University of Waterloo, Waterloo, Canada, 1998. Detailed Web Version at URL: ftp:\/\/orion.uwaterloo.ca\/pub\/henry\/reports\/gnsdplong.ps.gz."},{"key":"190478_CR24","series-title":"Communications Series","volume-title":"Topics in Semidefinite and Interior-Point Methods, The Fields Institute for Research in Mathematical Sciences","author":"M. Laurent","year":"1998","unstructured":"M. Laurent, \u201cA tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems,\u201d in Topics in Semidefinite and Interior-Point Methods, The Fields Institute for Research in Mathematical Sciences, Communications Series, vol. 18, American Mathematical Society: Providence, RI, 1998."},{"key":"190478_CR25","doi-asserted-by":"crossref","unstructured":"J. De Leeuw and W. Heiser, \u201cTheory of multidimensional scaling,\u201d in Handbook of Statistics, P.R. Krishnaiah and L.N. Kanal (Eds.), North-Holland, 1982, vol. 2, pp. 285\u2013316.","DOI":"10.1016\/S0169-7161(82)02016-1"},{"issue":"5","key":"190478_CR26","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/BF00890247","volume":"25","author":"S. Lele","year":"1993","unstructured":"S. Lele, \u201cEuclidean distance matrix analysis (EDMA): Estimation of mean form and mean form difference,\u201d Math. Geol., vol. 25,no. 5, pp. 573\u2013602, 1993.","journal-title":"Math. Geol."},{"key":"190478_CR27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01442889","volume":"6","author":"F. Lempio","year":"1980","unstructured":"F. Lempio and H. Maurer, \u201cDifferential stability in infinite-dimensional nonlinear programming,\u201d Appl. Math. Optim., vol. 6, pp. 139\u2013152, 1980.","journal-title":"Appl. Math. Optim."},{"key":"190478_CR28","series-title":"Technical Report","volume-title":"Global continuation for distance geometry problems","author":"J.J. Mor\u00e9","year":"1996","unstructured":"J.J. Mor\u00e9 and Z. Wu, \u201cGlobal continuation for distance geometry problems,\u201d Technical Report MCS-P505\u20130395, Applied Mathematics Division, Argonne National Labs, Chicago, IL, 1996."},{"key":"190478_CR29","series-title":"Technical Report","volume-title":"Distance geometry optimization for protein structures","author":"J.J. Mor\u00e9","year":"1997","unstructured":"J.J. Mor\u00e9 and Z. Wu, \u201cDistance geometry optimization for protein structures,\u201d Technical Report MCS-P628\u20131296, Applied Mathematics Division, Argonne National Labs, Chicago, IL, 1997."},{"key":"190478_CR30","series-title":"SIAM Publications","volume-title":"Interior Point Polynomial Algorithms in Convex Programming","author":"Y.E. Nesterov","year":"1994","unstructured":"Y.E. Nesterov and A.S. Nemirovski, Interior Point Polynomial Algorithms in Convex Programming, SIAM Publications, SIAM: Philadelphia, USA, 1994."},{"key":"190478_CR31","unstructured":"P.M. Pardalos, D. Shalloway, and G. Xue (Eds.), \u201cGlobal minimization of nonconvex energy functions: Molecular conformation and protein folding,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 23, American Mathematical Society: Providence, RI, 1996. Papers from the DIMACS Workshop held as part of the DIMACS Special Year on Mathematical Support for Molecular Biology at Rutgers University, New Brunswick, New Jersey, March 1995."},{"key":"190478_CR32","volume-title":"Cone programming and eigenvalue optimization: Geometry and algorithms","author":"G. Pataki","year":"1996","unstructured":"G. Pataki, \u201cCone programming and eigenvalue optimization: Geometry and algorithms,\u201d Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA, 1996."},{"key":"190478_CR33","volume-title":"An algorithmic analysis of multiquadratic and semidefinite programming problems","author":"M.V. Ramana","year":"1993","unstructured":"M.V. Ramana, \u201cAn algorithmic analysis of multiquadratic and semidefinite programming problems,\u201d Ph.D. Thesis, Johns Hopkins University, Baltimore, MD, 1993."},{"key":"190478_CR34","doi-asserted-by":"crossref","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"I.J. Schoenberg","year":"1935","unstructured":"I.J. Schoenberg, \u201cRemarks to Maurice Frechet's article: Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert,\u201d Ann. Math., vol. 36, pp. 724\u2013732, 1935.","journal-title":"Ann. Math."},{"key":"190478_CR35","unstructured":"J. Sturm, \u201cPrimal-dual interior point approach to semidefinite programming,\u201d Ph.D. Thesis, Erasmus University Rotterdam, 1997."},{"key":"190478_CR36","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0024-3795(94)00031-X","volume":"232","author":"P. Tarazaga","year":"1996","unstructured":"P. Tarazaga, T.L. Hayden, and J. Wells, \u201cCircum-Euclidean distance matrices and faces,\u201d Linear Algebra Appl., vol. 232, pp. 77\u201396, 1996.","journal-title":"Linear Algebra Appl."},{"key":"190478_CR37","series-title":"Technical Report","volume-title":"On search directions in interior-point methods for semidefinite programming","author":"M. Todd","year":"1997","unstructured":"M. Todd, \u201cOn search directions in interior-point methods for semidefinite programming,\u201d Technical Report TR1205, School of OR and IE, Cornell University, Ithaca, NY, 1997."},{"key":"190478_CR38","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"W.S. Torgerson","year":"1952","unstructured":"W.S. Torgerson, \u201cMultidimensional scaling. I. Theory and method,\u201d Psychometrika, vol. 17, pp. 401\u2013419, 1952.","journal-title":"Psychometrika"},{"key":"190478_CR39","series-title":"Technical Report","volume-title":"Applications of multidimensional scaling to molecular conformation","author":"M.W. Trosset","year":"1997","unstructured":"M.W. Trosset, \u201cApplications of multidimensional scaling to molecular conformation,\u201d Technical Report, Rice University, Houston, Texas, 1997."},{"key":"190478_CR40","series-title":"Technical Report","volume-title":"Computing distances between convex sets and subsets of the positive semidefinite matrices","author":"M.W. Trosset","year":"1997","unstructured":"M.W. Trosset, \u201cComputing distances between convex sets and subsets of the positive semidefinite matrices,\u201d Technical Report, Rice University, Houston, Texas, 1997."},{"key":"190478_CR41","series-title":"Technical Report","volume-title":"Distance matrix completion by numerical optimization","author":"M.W. Trosset","year":"1997","unstructured":"M.W. Trosset, \u201cDistance matrix completion by numerical optimization,\u201d Technical Report, Rice University, Houston, Texas, 1997."},{"key":"190478_CR42","unstructured":"L. Vandenberghe and S. Boyd, \u201cPositive definite programming,\u201d in Mathematical Programming: State of the Art, 1994, The University of Michigan, 1994, pp. 276\u2013308."},{"key":"190478_CR43","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd, \u201cSemidefinite programming,\u201d SIAM Review, vol. 38, pp. 49\u201395, 1996.","journal-title":"SIAM Review"},{"key":"190478_CR44","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(81)90143-9","volume":"40","author":"H. Wolkowicz","year":"1981","unstructured":"H. Wolkowicz, \u201cSome applications of optimization in matrix theory,\u201d Linear Algebra and its Applications, vol. 40, pp. 101\u2013118, 1981.","journal-title":"Linear Algebra and its Applications"},{"key":"190478_CR45","volume-title":"Primal-Dual Interior-Point Methods","author":"S. Wright","year":"1996","unstructured":"S. Wright, Primal-Dual Interior-Point Methods, SIAM: Philadelphia, PA, 1996."},{"key":"190478_CR46","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Y. Ye","year":"1997","unstructured":"Y. Ye, Interior Point Algorithms: Theory and Analysis, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons: New York, 1997."},{"key":"190478_CR47","first-page":"21","volume":"4","author":"F.Z. Zhang","year":"1987","unstructured":"F.Z. Zhang, \u201cOn the best Euclidean fit to a distance matrix,\u201d Beijing Shifan Daxue Xuebao, vol. 4, pp. 21\u201324, 1987.","journal-title":"Beijing Shifan Daxue Xuebao"},{"key":"190478_CR48","series-title":"Technical Report","volume-title":"A stochastic\/perturbation global optimization algorithm for distance geometry problems","author":"Z. Zou","year":"1996","unstructured":"Z. Zou, R.H. Byrd, and R.B. Schnabel, \u201cA stochastic\/perturbation global optimization algorithm for distance geometry problems,\u201d Technical Report, Department of Computer Science, University of Colorado, Boulder, CO, 1996."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008655427845.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008655427845\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008655427845.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:30:29Z","timestamp":1752377429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008655427845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":48,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["190478"],"URL":"https:\/\/doi.org\/10.1023\/a:1008655427845","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}