Euclidean distance matrices, semidefinite programming and sensor network localization

Portugaliae Mathematica

Volumn 68, Issue 1, 2011, Pages 53-102

  Alfakih, Abdo Y ^a   Anjos, Miguel F ^b   Piccialli, Veronica ^c   Wolkowicz, Henry ^a,d  

^a UNIVERSITY OF WINDSOR   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Euclidean distance matrix completions; Fundamental problem of distance geometry; Semidefinite programming; Sensor network localization

Indexed keywords

EID: 84862705457     PISSN: 00325155     EISSN: 16622758     Source Type: Journal    
DOI: 10.4171/PM/1881     Document Type: Article

References (109)

1. A. Y. Alfakih, On the uniqueness of generic bar-and-joint frameworks. Technical report, University of Windsor, Windsor, Ontario, 2007.
2. A. Y. Alfakih, A. Khandani, and H. Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12 (1999), 13-30. Zbl 1040.90537 MR 1704098
3. S. Al-Homidan, Hybrid methods for optimization problems with positive semidefin- ite matrix constraints. PhD thesis, University of Dundee, 1993.
4. S. Al-Homidan and R. Fletcher, Hybrid methods for finding the nearest Euclidean distance matrix. In Recent advances in nonsmooth optimization, World Sci. Publ., Singapore 1995, 1-17. Zbl 0928.65077 MR 1459991
5. S. Al-Homidan and H. Wolkowicz, Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming. Linear Algebra Appl. 406 (2005), 109-141. Zbl 1081.15011 MR 2156431
6. L. Asimow and B. Roth, The rigidity of graphs. Trans. Amer. Math. Soc. 245 (1978), 279-289. Zbl 0392.05026 MR 511410
7. L. Asimow and B. Roth, The rigidity of graphs. II. J. Math. Anal. Appl. 68 (1979), 171-190. Zbl 0441.05046 MR 531431
8. J. Aspnes, T. Eren, D. K. Goldenberg, A. S. Morse, W. Whiteley, Y. R. Yang, B. D. O. Anderson, and P. N. Belhumeur, A theory of network localization. IEEE Trans. Mobile Comput. 12 (2006), 1663-1678.
9. M. Bakonyi and C. R. Johnson, The Euclidean distance matrix completion problem. SIAM J. Matrix Anal. Appl. 16 (1995), 646-654. Zbl 0823.15012 MR 1321802
10. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye. Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sensor Network 2 (2006), 188-220.
11. P. Biswas, T.-C. Liang, K.-C. Toh, Y. Ye, and T.-C. Wang, Semidefinite program- ming approaches for sensor network localization with noisy distance measurements IEEE Trans. Autom. Sci. Eng. 3 (2006), 360-371.
12. P. Biswas, K.-C. Toh, and Y. Ye, A distributed SDP approach for large-scale noisy anchor-free graph reailzation with applications to molecular conformation. SIAM J. Sci. Comput. 30 (2008), 1251-1277. Zbl 1161.49028 MR 2398864
13. P. Biswas and Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization. In IPSN '04, Proc. 3rd internat. symp. information processing in sensor networks, Association for Computing Machinery, New York 2004, 46-54.
14. P. Biswas and Y. Ye, A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. In Multiscale optimization methods and applications, Nonconvex Optim. Appl. 82, Springer, New York 2006, 69-84. Zbl 1100.90029 MR 2191577
15. Å. Björck, Numerical methods for least squares problems. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1996. Zbl 0847.65023 MR 1386889
16. J. Blitzer, K. Q. Weinberger, L. K. Saul, and F. C. N. Pereira, Hierarchical dis- tributed representations for statistical language modeling. In Advances in Neural Information Processing Systems 17, MIT Press, Cambridge, Mass., 2005, 185-192.
17. L. M. Blumenthal, Theory and applications of distance geometry. Second edition, Chelsea Publishing Co., New York 1970. Zbl 0208.24801 MR 0268781
18. A. M. Burrows, J. T. Richtsmeier, M. P. Mooney, T. D. Smith, H. W. Losken, and M. I. Siegel, Three-dimensional analysis of craniofacial form in a familial rabbit model of nonsyndromic coronal suture synostosis using Euclidean distance matrix analysis. The Cleft Palate-Craniofacial Journal 36 (1999), 196-206.
19. E. Candes and M. Wakin, An introduction to compressive sensing. IEEE Signal Process. Mag. 25 (2008), no. 2, 21-30.
20. M. W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye, SpaseLoc: an adaptive sub- problem algorithm for scalable wireless sensor network localization. SIAM J. Optim. 17 (2006), 1102-1128. Zbl 1136.90321 MR 2274505
21. A. Cassioli, Global optimization of highly multimodal problems. PhD thesis, Univer- sita di Firenze, Firenze 2008.
22. K. Chakrabarty and S. S. Iyengar, Scalable infrastructure for distributed sensor net- works. Springer, London 2005.
23. R. Connelly, Rigidity and energy. Invent. Math. 66 (1982), 11-33. Zbl 0485.52001 MR 652643
24. R. Connelly, On generic global rigidity. In Applied geometry and discrete mathe- matics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 4, Amer. Math. Soc., Providence, RI, 1991, 147-155. Zbl 0736.05069 MR 1116345
25. R. Connelly, Rigidity. In Handbook of convex geometry. Vol. A, North-Holland, Amsterdam 1993, 223-271. Zbl 0788.52001 MR 1242981
26. R. Connelly, Tensegrity frameworks: Why are they stable? In Rigidity theory and applications, Kluwer Academic/Plenum Publishers, New York, 1999, 47-54.
27. R. Connelly, Generic global rigidity. Discrete Comput. Geom. 33 (2005), 549-563. Zbl 1072.52016 MR 2132290
28. R. Connelly and M. Sloughter, Realizability of graphs. Technical report, Dept. of Math., Cornell University, Ithaca, NY, 2004.
29. J. A. Costa, N. Patwari, and A. O. Hero, III, Distributed weighted-multidimensional scaling for node localization in sensor networks. ACM Trans. Sensor Network 2 (2006), 39-64.
30. G. M. Crippen, Chemical distance geometry: Current realization and future projec- tion. J. Math. Chem. 6 (1991), 307-324.
31. G. M. Crippen and T. F. Havel, Distance geometry and molecular conformation. Che- mometrics Series 15, Research Studies Press Ltd., Chichester 1988. Zbl 1066.51500 MR 0975025
32. B. C. Csáji, J. Küng, J. Palkoska and R. Wagner. On the automation of similarity information maintenance in flexible query answering systems. In Database and expert systems applications (DEXA 2004), Lect. Notes Comput. Sci. 3180, Springer-Verlag, Berlin 2004, 130-140.
33. J. Dattorro, Convex optimization & Euclidean distance geometry. Meboo Publishing USA, Palo Alto, CA, 2005.
34. J. Dattorro, Equality relating Euclidean distance cone to positive semidefinite cone. Linear Algebra Appl. 428 (2008), 2597-2600. Zbl 1142.15014 MR 2416574
35. Y. Ding, N. Krislock, J. Qian, and H. Wolkowicz, Sensor network localization, Euclidean distance matrix completions, and graph realization. In MELT '08: Pro- ceedings of the first ACM international workshop on mobile entity localization and tracking in GPS-less environments, Association for Computing Machinery, New York 2008, 129-134.
36. Y. Ding, N. Krislock, J. Qian, and H. Wolkowicz, Sensor network localization, Euclidean distance matrix completions, and graph realization. Optim. Eng. 11 (2010), 45-66. MR 2601732
37. L. Doherty, K. S. J. Pister, and L. El Ghaoui, Convex position estimation in wireless sensor networks. In Proceedings IEEE INFOCOM 2001, Vol. 3, IEEE, Piscataway, NJ, 2001, 1655-1663.
38. Q. Dong and Z. Wu, A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Global Optim. 26 (2003), 321-333. Zbl 1032.92036 MR 1977953
39. A. W. M. Dress and T. F. Havel, The fundamental theory of distance geometry. In Raisonnement géométrique assisté par ordinateur (Sophia-Antipolis, 1987), Vol. I, INRIA Rocquencourt, Le Chesnay 1987, 127-169. MR 0921058
40. T. Eren, D. K. Goldenberg, W. Whiteley, Y. R. Yang, A. S. Morse, B. D. O. Ander- son, and P. N. Belhumeur, Rigidity, computation, and randomization of network localization. Proceedings IEEE INFOCOM 2004, Vol. 4, IEEE, Piscataway, NJ, 2004, 2673-2684.
41. R. W. Farebrother, Three theorems with applications to Euclidean distance matrices. Linear Algebra Appl. 95 (1987), 11-16. Zbl 0627.15008 MR 907390
42. V. F. Ferrario, C. Sforza, A. Miani, Jr, and G. Serrao, A three-dimensional evalua- tion of human facial asymmetry. J. Anat. 186 (1995), 103-110.
43. M. Fukuda, M. Kojima, K. Murota, and K. Nakata, Exploiting sparsity in semide- finite programming via matrix completion. I: General framework. SIAM J. Optim. 11 (2000/01), 647-674 (electronic). Zbl 1010.90053 MR 1814036
44. H. N. Gabow and H. H. Westermann, Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7 (1992), 465-497. Zbl 0771.05026 MR 1154585
45. D. Gale, Neighboring vertices on a convex polyhedron. In Linear inequalities and related systems, Ann. of Math. Stud. 38, Princeton University Press, Princeton, N.J., 1956, 255-263. Zbl 0072.37805 MR 0085552
46. M. R. Garey and D. S. Johnson, Computers and intractability. W. H. Freeman and Co., San Francisco 1979. Zbl 0411.68039 MR 0519066
47. H. Gluck, Almost all simply connected closed surfaces are rigid. In Geometric topology (Proc. Conf., Park City, Utah, 1974), Lecture Notes in Math. 438, Springer, Berlin 1975, 225-239. Zbl 0315.50002 MR 0400239
48. W. Glunt, T. L. Hayden, S. Hong, and J. Wells, An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11 (1990), 589-600. Zbl 0728.65034 MR 1066161
49. S. J. Gortler, A. D. Healy, and D. P. Thurston, Characterizing generic global rigid- ity. Amer. J. Math. 132 (2010), 897-939. Zbl 1202.52020 MR 2663644
50. S. J. Gortler and D. P. Thurston, Characterizing the universal rigidity of generic frameworks. Preprint 2009. arXiv:1001.0172
51. J. C. Gower, Euclidean distance geometry. Math. Sci. 7 (1982), 1-14. Zbl 0492.51017 MR 642165
52. J. C. Gower, Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra Appl. 67 (1985), 81-97. Zbl 0569.15016 MR 787367
53. H. Grassmann, Extension theory. History of Mathematics 19, American Mathemati- cal Society, Providence, RI, 2000. Zbl 0953.01025 MR 1747519
54. J. Graver, B. Servatius, and H. Servatius, Combinatorial rigidity. Grad. Stud. Math. 2, American Mathematical Society, Providence, RI, 1993. Zbl 0788.05001 MR 1251062
55. M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its conse- quences in combinatorial optimization. Combinatorica 1 (1981), 169-197. Zbl 0492.90056 MR 625550
56. T. F. Havel, Metric matrix embedding in protein structure calculations, NMR spec- tra analysis, and relaxation theory. Magn. Reson. Chem. 41 (2003), S37-S50.
57. T. L. Hayden, J. Wells, W. M. Liu, and P. Tarazaga, The cone of distance matrices. Linear Algebra Appl. 144 (1991), 153-169. Zbl 0718.15011 MR 1081882
58. B. Hendrickson, The molecule problem: determining conformation from pairwise distances. PhD thesis, Cornell University, Ithaca, NY, 1990.
59. B. Hendrickson, Conditions for unique graph realizations. SIAM J. Comput. 21 (1992), 65-84. Zbl 0756.05047 MR 1148818
60. B. Hendrickson, The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5 (1995), 835-857. Zbl 0844.05093 MR 1358807
61. H.-X. Huang, Z.-A. Liang, and P. M. Pardalos, Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems. J. Global Optim. 25 (2003), 3-21. Zbl 1037.15015 MR 1969424
62. B. Jackson and T. Jordán, Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory Ser. B 94 (2005), 1-29. Zbl 1076.05021 MR 2130278
63. B. Jackson, T. Jordán, and Z. Szabadka, Globally linked pairs of vertices in equi- valent realizations of graphs. Discrete Comput. Geom. 35 (2006), 493-512. Zbl 1088.05056 MR 2202116
64. H. Jin, Scalable sensor localization algorithms for wireless sensor networks. PhD thesis, University of Toronto, Toronto, Ontario, 2005.
65. C. R. Johnson, B. Kroschel, and H. Wolkowicz, An interior-point method for approximate positive semidefinite completions. Comput. Optim. Appl. 9 (1998), 175-190. Zbl 0907.90207 MR 1601892
66. C. R. Johnson and P. Tarazaga, Connections between the real positive semidefinite and distance matrix completion problems. Linear Algebra Appl. 223/224 (1995), 375-391. Zbl 0827.15032 MR 1340702
67. D. S. Kim, Sensor network localization based on natural phenomena. PhD thesis, MIT, Cambridge 2006.
68. S. Kim, M. Kojima, and H. Waki, Exploiting sparsity in SDP relaxation for sensor network localization. SIAM J. Optim. 20 (2009), 192-215. Zbl 1190.65096 MR 2496899
69. S. Kim, M. Kojima, H. Waki, and M. Yamashita, SFSDP: a Sparse version of full semidefinite programming relaxation for sensor network localization problems. Tech- nical Report B-457, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo 2009.
70. N. Krislock, Efficient algorithms for large-scale Euclidean distance matrix problems with applications to wireless sensor network localization and molecular conforma- tion. PhD thesis, University of Waterloo, Waterloo, Ontario, 2010.
71. N. Krislock, V. Piccialli, and H. Wolkowicz, Robust semidefinite programming approaches for sensor network localization with anchors. Research Report CORR 12, Dept. Combinatorics and Optimization, University of Waterloo, Waterloo, On- tario, 2006. http://orion.uwaterloo.ca/~hwolkowi/henry/reports/ABSTRACTS.html
72. N. Krislock, F. Rendl, and H. Wolkowicz, Noisy sensor network localization using semidefinite representations and facial reduction. Research Report CORR 2010-01, University of Waterloo, Waterloo, Ontario, 2010. http://orion.uwaterloo.ca/~hwolkowi/henry/reports/ABSTRACTS.html
73. N. Krislock and H. Wolkowicz, Explicit sensor network localization using semi- definite representations and facial reductions. SIAM J. Optim. 20 (2010), 2679- 2708. MR 2678410
74. G. Laman, On graphs and rigidity of plane skeletal structures. J. Engrg. Math. 4 (1970), 331-340. Zbl 0213.51903 MR 0269535
75. J. B. Lasserre, Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 (2001), 796-817. Zbl 1010.90061 MR 1814045
76. M. Laurent, Cuts, matrix completions and graph rigidity. Math. Programming 79 (1997), 255-283. Zbl 0887.90174 MR 1464770
77. M. Laurent, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems. In Topics in semidefinite and interior-point methods, Fields Inst. Commun. 18, Amer. Math. Soc., Providence, RI, 1998, 51-76. Zbl 0906.05074 MR 1607310
78. L. Lovász and Y. Yemini, On generic rigidity in the plane. SIAM J. Algebraic Dis- crete Methods 3 (1982), 91-98. MR 644960
79. J. J. Moré and Z. Wu, e-optimal solutions to distance geometry problems via global continuation. In Global minimization of nonconvex energy functions: molecular confor- mation and protein folding (New Brunswick, NJ, 1995), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 23, Amer. Math. Soc., Providence, RI, 1996, 151-168. Zbl 0857.49023 MR 1369128
80. J. J. Moré and Z. Wu, Global continuation for distance geometry problems. SIAM J. Optim. 7 (1997), 814-836. Zbl 0891.90168 MR 1462067
81. J. J. Moré and Z. Wu, Distance geometry optimization for protein structures. J. Global Optim. 15 (1999), 219-234. Zbl 0944.92012 MR 1737437
82. K. Nakata, K. Fujisawa, M. Fukuda, M. Kojima, and K. Murota, Exploiting sparsity in semidefinite programming via matrix completion. II. Implementation and numerical results. Math. Programming 95 (2003), 303-327. Zbl 1030.90081 MR 1976483
83. S. Nawaz, Anchor free localization for ad-hoc wireless sensor networks. PhD thesis, University of New South Wales, Sydney 2008.
84. J. Nie, Sum of squares method for sensor network localization. Comput. Optim. Appl. 43 (2009), 151-179. Zbl 1170.90510 MR 2506248
85. P. M. Pardalos, D. Shalloway, and G. Xue (eds.), Global minimization of nonconvex energy functions: molecular conformation and protein folding. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 23, Amer. Math. Soc., Providence, RI, 1996. Zbl 0831.00024 MR 1369122
86. T. K. Pong and P. Tseng, (Robust) edge-based semidefinite programming relaxation of sensor network localization. Technical Report Jan-09, University of Washington, Seattle, WA, 2009; Math. Programming, DOI 10.1007/s10107-009-0338-x
87. M. V. Ramana, L. Tunçel, and H. Wolkowicz, Strong duality for semidefinite pro- gramming. SIAM J. Optim. 7 (1997), 641-662. Zbl 0891.90129 MR 1462059
88. B. Recht, M. Fazel, and P. A. Parrilo, Guaranteed minimum-rank solutions of lin- ear matrix equations via nuclear norm minimization. SIAM Rev. 52 (2010), 471-501. Zbl 1198.90321 MR 2680543
89. K. Römer, Time synchronization and localization in sensor networks. PhD thesis, No. 16106, ETH Zurich, Zurich 2005.
90. C. Savarese, J. Rabaey, and J. Beutel, Locationing in distributed ad-hoc wireless sen- sor networks. In 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing, Proceedings, IEEE, Piscataway. NJ, 2001, 2037-2040.
91. A. Savvides, C.-C. Han, and M. B. Strivastava, Dynamic fine-grained localization in ad-hoc networks of sensors. In MobiCom 2001: Proceedings of the 7th annual interna- tional conference on mobile computing and networking, Association for Computing Machinery, New York 2001, 166-179.
92. J. B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard. In Pro- ceedings Seventeenth Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Department of Electrical Engineering, Urbana- Champaign, Illinois, 1979.
93. I. J. Schoenberg, Remarks to Maurice Fréchet's article "Sur la définition axioma- tique d'une classe d'espace distanciés vectoriellement applicable sur l'espace de Hilbert". Ann. of Math. (2) 36 (1935), 724-732. JFM 61.0435.04 Zbl 0012.30703 MR 1503248
94. A. M.-C. So and Y. Ye, Theory of semidefinite programming for sensor network localization. Math. Programming 109 (2007), 367-384. Zbl 05131081 MR 2295148
95. W. S. Torgerson, Multidimensional scaling. I. Theory and method. Psychometrika 17 (1952), 401-419. Zbl 0049.37603 MR 0054219
96. M. W. Trosset, Computing distances between convex sets and subsets of the positive semidefinite matrices. Technical report, Rice University, Houston, Texas, 1997.
97. M. W. Trosset, Applications of multidimensional scaling to molecular conformation. Computing Science and Statistics 29 (1998), 148-152.
98. M. W. Trosset, Distance matrix completion by numerical optimization. Comput. Optim. Appl. 17 (2000), 11-22. Zbl 0964.65047 MR 1791595
99. P. Tseng, Second-order cone programming relaxation of sensor network localization. SIAM J. Optim. 18 (2007), 156-185. Zbl 1176.90454 MR 2299679
100. S. Urabl, Cooperative localization in wireless sensor networks. Master's thesis, Uni- versity of Klagenfurt, Klagenfurt, Austria, 2009.
101. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17 (2006), 218-242. Zbl 1109.65058 MR 2219151
102. Z. Wang, S. Zheng, Y. Ye, and S. Boyd, Further relaxations of the semidefinite programming approach to sensor network localization. SIAM J. Optim. 19 (2008), 655-673. Zbl 1173.90498 MR 2425034
103. K. Q. Weinberger, F. Sha, and L. K. Saul, Learning a kernel matrix for nonlinear dimensionality reduction. In ICML '04 Proceedings of the twenty-first international conference on Machine learning, Association for Computing Machinery, New York 2004, 106.
104. W. Whiteley, Matroids and rigid structures. In Matroid applications, Encyclopedia Math. Appl. 40, Cambridge Univ. Press, Cambridge 1992, 1-53. Zbl 0768.05025 MR 1165538
105. H. Wolkowicz, R. Saigal, and L. Vandenberghe (eds.), Handbook of semidefinite programming. International Series in Operations Research & Management Science 27. Kluwer Academic Publishers, Norwell, MA, 2000.
106. D. Wu and Z. Wu, An updated geometric build-up algorithm for solving the mo- lecular distance geometry problems with sparse distance data. J. Global Optim. 37 (2007), 661-673. Zbl 1119.92032 MR 2302995
107. J.-M. Yoon, Y. Gad, and Z. Wu, Mathematical modeling of protein structure using distance geometry. Technical report, University of Houston, Houston 2000.
108. F. Z. Zhang, On the best Euclidean fit to a distance matrix. J. Beijing Normal Univ. (Nat. Sci.) 1987 (1987), No. 4, 21-24. Zbl 0655.15023 MR 939410
109. Z. Zou, R. H. Byrd, and R. B. Schnabel, A stochastic/perturbation global optimiza- tion algorithm for distance geometry problems. Technical report, Dept. of Computer Science, University of Colorado, Boulder, Co., 1996.