Euclidean distance matrix completion problems

Optimization Methods and Software

Volumn 27, Issue 4-5, 2012, Pages 695-717

  Fang, Haw Ren ^a,b   O'Leary, Dianne P ^c  

^a University of Minnesota   (United States)

^b METROPOLITAN STATE UNIVERSITY   (United States)

^c Institute of Advanced Computer Science   (United States)

Author keywords

dimensionality relaxation; distance geometry; Euclidean distance matrices; global optimization; modified Cholesky factorizations; molecular conformation

Indexed keywords

CHOLESKY FACTORIZATIONS; DIMENSIONALITY RELAXATION; DISTANCE GEOMETRY; EUCLIDEAN DISTANCE MATRICES; MOLECULAR CONFORMATION;

CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; NEWTON-RAPHSON METHOD;

MATRIX ALGEBRA;

EID: 84862639933     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2011.643888     Document Type: Article

References (38)

1. A.Y. Alfakih, On the uniqueness of Euclidean distance matrix completions, Linear Algebra Appl. 370 (2003), pp. 1-14.
2. A. Alfakih, M. Anjos, V. Piccialli, and H.Wolkowicz, Euclidean distance matrices, semidefinite programming, and sensor network localization, Port. Math. 68 (2011), pp. 53-102.
3. A.Y. Alfakih, A. Khandani, and H.Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl. 12 (1999), pp. 13-30. Available at citeseer.ist.psu.edu/alfakih97solving. html.
4. A.Y. Alfakih and H.Wolkowicz, On the Embeddability ofWeighted Graphs in Euclidean Spaces, Tech. Rep. CORR 98-12, Computer Science Department, University ofWaterloo, Ontario, 1998.
5. M. Bakonyi and C.R. Johnson, The Euclidean distance matrix completion problem, SIAM J. Matrix Anal. Appl. 16 (1995), pp. 646-654.
6. H.M. Berman, J.Westbrook, Z. Feng, G. Gilliland, T. Bhat, H.Weissig, I.N. Shindyalov, and P.E. Bourne, The protein data bank, Nucleic Acids Res. 28 (2000), pp. 235-242.
7. G.M. Crippen, Conformational analysis by energy embedding, J. Comput. Chem. 3 (1982), pp. 471-476.
8. G.M. Crippen, Conformational analysis by scaled energy embedding, J. Comput. Chem. 5 (1984), pp. 548-554.
9. H.-r. Fang, Matrix factorization, triadic matrices, and modified Cholesky factorizations for optimization, Ph.D. thesis, University of Maryland, MD, 2006.
10. H.-r. Fang and D.P. O'Leary, Modified Cholesky factorizations: A catalog with new approaches, Math. Program. A 115 (2008), pp. 319-349.
11. R.W. Floyd, Algorithm 97: Shortest path, Commun. ACM 5 (1962), p. 345.
12. W. Glunt, T.L. Hayden, and M. Raydan, Molecular conformation from distance matrices, J. Comput. Chem. 14 (1993), pp. 114-120.
13. J.C. Gower, Some distance properties of latent root and vector methods used in multivariate analysis, Biometrika 53 (1966), pp. 325-338.
14. J.C. Gower, Properties of Euclidean and non-Euclidean distance matrices, Linear Algebra Appl. 67 (1985), pp. 81-97.
15. I.G. Grooms, R.M. Lewis, and M.W. Trosset, Molecular embedding via a second order dissimilarity parameterized approach, SIAM J. Sci. Comput. 31 (2009), pp. 2733-2756.
16. T.F. Havel, An evaluation of computational strategies for use in the determination of protein structure from distance geometry constraints obtained by nuclear magnetic resonance, Prog. Biophys. Mol. Biol. 56 (1991), pp. 43-78.
17. B. Hendrickson, Conditions for unique graph realizations, SIAM J. Sci. Comput. 21 (1992), pp. 65-84.
18. B. Hendrickson, The molecule problem: Exploiting structure in global optimization, SIAM J. Optim. 5 (1995), pp. 835-857.
19. C.R. Johnson, Connections between the real positive semidefinite and distance matrix completion problems, Linear Algebra Appl. 223-224 (1995), pp. 375-391.
20. E. Kokiopoulou and Y. Saad, Orthogonal Neighborhood Preserving Projections, Proceedings of the 5th IEEE International Conference on Data Mining, 2005, pp. 234-241. DOI:10.1109/ICDM.2005.113.
21. E. Kokiopoulou andY. Saad, Orthogonal neighborhood preserving projections: A projection-based dimensionality reduction technique, IEEE Trans. Pattern Anal. Mach. Intell. 29 (2007), pp. 2143-2156.
22. T.G. Kolda, D.P. O'Leary, and L. Nazareth, BFGS with update skipping and varying memory, SIAM J. Optim. 8 (1998), pp. 1060-1083.
23. N. Krislock and H. Wolkowicz, Explicit sensor network localization using semidefinite representations and facial reductions, SIAM J. Optim. 20 (2010), pp. 2679-2708.
24. J.C. Meza, R.A. Oliva, P.D. Hough, and P.J.Williams, OPT++:An object-oriented toolkit for nonlinear optimization, ACM Trans. Math. Softw. 33 (2007), p. 12.
25. J.J. Moré and Z.Wu, Optimal solutions to distance geometry problems via global continuation, Technical Report MCS-P520-0595, Mathematics and Computer Science Division, Argonne National Laboratory, 1995.
26. J.J. Moré and Z.Wu, Global continuation for distance geometry problems, SIAM J. Optim. 7 (1997), pp. 814-836.
27. J.J. Moré and Z.Wu, Distance geometry optimization for protein structures, J. Global Optim. 15 (1999), pp. 219-234.
28. E.O. Purisima and H.A. Scheraga, An approach to the multiple-minima problems by relaxing dimensionality, Proc. Natl. Acad. Sci. USA 83 (1986), pp. 2782-2786.
29. R.B. Schnabel and E. Eskow, A new modified Cholesky factorization, SIAM J. Sci. Stat. Comput. 11 (1990), pp. 1136-1158.
30. R.B. Schnabel and E. Eskow, A revised modified Cholesky factorization algorithm, SIAM J. Optim. 9 (1999), pp. 1135-1148.
31. I.J. Schoenberg, Remarks to Maurice Fréchet's article: 'Sur la définition axiomatique d'une classe d'espace distanciés vectoriellement applicable sur l'espace de Hilbert', Ann. Math. 36 (1935), pp. 724-732.
32. J.B.Tenenbaum,V. deSilva, and J.C. Langford,Aglobal geometric framework for nonlinear dimensionality reduction, Science 290 (2000), pp. 2319-2323.
33. W.S. Torgerson, Multidimensional scaling: I. Theory and method, Psychometrika 30 (1952), pp. 333-367.
34. M.W. Trosset, Applications of multidimensional scaling to molecular conformation, Comput. Sci. Statist. 29 (1998), pp. 148-152.
35. M.W. Trosset, Distance matrix completion by numerical optimization, Comput. Optim. Appl. 17 (2000), pp. 11-22.
36. S.Warshall, A theorem on boolean matrices, J. ACM 9 (1962), pp. 11-12.
37. G. Young and A.S. Householder, Discussion of a set of points in terms of their mutual distances, Psychometrika 3 (1938), pp. 19-22.
38. Z. Zou, R.H. Byrd, and R.B. Schnabel,Astochastic/perturbation global optimization algorithm for distance geometry problems, J. Global Optim. 11 (1997), pp. 91-105.Available at citeseer.ist.psu.edu/243345.html, mistakenly indexed by the journal under 'Bird' instead of 'Byrd'.