On the uniqueness of Euclidean distance matrix completions: The case of points in general position

Linear Algebra and Its Applications

Volumn 397, Issue 1-3, 2005, Pages 265-277

  Alfakih, Abdo Y ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Euclidean distance matrices; Gale transform; Matrix completion problems; Points in general position; Semidefinite programming

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

EUCLIDEAN DISTANCE MATRICES; GALE TRANSFORM; MATRIX COMPLETION PROBLEMS; POINTS IN GENERAL POSITION; SEMIDEFINITE PROGRAMMING;

MATRIX ALGEBRA;

EID: 12444303277     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2004.10.025     Document Type: Article

References (25)

1. A.Y. Alfakih On the uniqueness of Euclidean distance matrix completions Linear Algebra Appl. 370 2003 1 14
2. A.Y. Alfakih, A correction: on the uniqueness of Euclidean distance matrix completions, 2004
3. A.Y. Alfakih, A. Khandani, and H. Wolkowicz Solving Euclidean distance matrix completion problems via semidefinite programming Comput. Optim. Appl. 12 1999 13 30
4. M. Bakonyi, and C.R. Johnson The Euclidean distance matrix completion problem SIAM J. Matrix Anal. Appl. 16 1995 646 654
5. P. Biswas, Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, Technical report, Department of Management Science and Engineering, Stanford University, 2003
6. G.M. Crippen, and T.F. Havel Distance Geometry and Molecular Conformation 1988. Wiley New York
7. F. Critchley On certain linear mappings between inner-product and squared distance matrices Linear Algebra Appl. 105 1988 91 107
8. E. de Klerk, T. Terlaky, and K. Roos Self-dual embeddings H. Wolkowicz R. Saigal L. Vandenberghe Handbook of Semidefinite Programming 2000 Kluwer Academic Publishers Boston, MA 111 138
9. D. Gale Neighboring vertices on a convex polyhedron in: Linear Inequalities and Related System 1956 Princeton University Press 255 263
10. J.C. Gower Properties of Euclidean and non-Euclidean distance matrices Linear Algebra Appl. 67 1985 81 97
11. T.L. Hayden, J. Wells, W.-M. Liu, and P. Tarazaga The cone of distance matrices Linear Algebra Appl. 144 1991 153 169
12. B. Hendrickson The molecule problem: exploiting structure in global optimization SIAM J. Optim. 5 1995 835 857
13. C.R. Johnson Matrix completion problems: a survey C.R. Johnson Proc. Sympos. Appl. Math. Matrix Theory and Applications vol. 40 1990 AMS Providence, RI 171 198
14. C.R. Johnson, C. Jones, and B. Kroschel The distance matrix completion problem: cycle completability Linear Multilinear Algebra 39 1995 195 207
15. M. Laurent A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems in: Topics in Semidefinite and Interior-Point Methods The Fields Institute for Research in Mathematical Sciences Communications Services vol. 18 1998 AMS Providence, RI 51 76
16. M. Laurent Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems SIAM J. Matrix Anal. Appl. 22 2000 874 894
17. J. De Leeuw, and W. Heiser Theory of multidimensional scaling P.R. Krishnaiah L.N. Kanal Handbook of Statistics vol. 2 1982 North-Holland 285 316
18. C.-K. Li, T. Milligan, Uniqueness of the solutions of some completion problems, Technical report, Department of Mathematics, The College of William and Mary, 2003
19. J. Moré, and Z. Wu Distance geometry optimization for protein structures J. Global Optim. 15 1999 219 234
20. R.T. Rockafellar Convex Analysis 1970. Princeton University Press
21. I.J. Schoenberg Remarks to Maurice Frechet's article: Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert Ann. Math. 36 1935 724 732
22. A.M.-C. So, Y. Ye, Theory of semidefinite programming for sensor network localization, Technical report, Department of Management Science and Engineering, Stanford University, 2004
23. J.F. Sturm, Let SeDuMi seduce you, October 2001. Available from: 〈http://fewcal.kub.nl/sturm/software/sedumi.html〉
24. M.W. Trosset Distance matrix completion by numerical optimization Comput. Optim. Appl. 17 2000 11 22
25. H. Wolkowicz R. Saigal L. Vandenberghe Handbook of Semidefinite Programming. Theory, Algorithms and Applications 2000 Kluwer Academic Publishers Boston, MA