Euclidean Distance Matrices and Applications

Euclidean distance matrices, or EDMs, have been receiving increased attention for two main reasons. The first reason is that the many applications of EDMs, such as molecular conformation in bioinformatics, dimensionality reduction in machine learning and statistics, and especially the problem of wireless sensor network localization, have all become very active areas of research. The second reason for this increased interest is the close connection between EDMs and semidefinite matrices. Our recent ability to solve semidefinite programs efficiently means we can now also solve many problems involving EDMs efficiently. This chapter connects the classical approaches for EDMs with the more recent tools from semidefinite programming. We emphasize the application to sensor network localization.

[1]  Henry Wolkowicz,et al.  Two theorems on Euclidean distance matrices and Gale transform , 2002 .

[2]  I. J. Schoenberg.  Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert , 1935 .

[3]  J. Gower.  Properties of Euclidean and non-Euclidean distance matrices , 1985 .

[4]  Abdo Y. Alfakih,et al.  On dimensional rigidity of bar-and-joint frameworks , 2007, Discret. Appl. Math..

[5]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[6]  M. Laurent.  A tour d’horizon on positive semidefinite and Euclidean distance matrix completion problems , 1998 .

[7]  H. Wolkowicz,et al.  Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization , 2006, MELT '08.

[8]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..

[9]  Qunfeng Dong,et al.  A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data , 2003, J. Glob. Optim..

[10]  A. Y. Alfakih,et al.  A remark on the faces of the cone of Euclidean distance matrices , 2006 .

[11]  Marcos Raydan,et al.  Molecular conformations from distance matrices , 1993, J. Comput. Chem..

[12]  Nathan Krislock,et al.  Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions , 2010, SIAM J. Optim..

[13]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[14]  P. Sreenivasa Kumar,et al.  Minimal Vertex Separators of Chordal Graphs , 1998, Discret. Appl. Math..

[15]  A. Y. Alfakih,et al.  On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices , 2006 .

[16]  Timothy F. Havel.  Metric matrix embedding in protein structure calculations, NMR spectra analysis, and relaxation theory , 2003 .

[17]  Kilian Q. Weinberger,et al.  Learning a kernel matrix for nonlinear dimensionality reduction , 2004, ICML.

[18]  F. Critchley.  On certain linear mappings between inner-product and squared-distance matrices , 1988 .

[19]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[20]  Jon C. Dattorro,et al.  Convex Optimization & Euclidean Distance Geometry , 2004 .

[21]  Xiang-Yang Li.  Wireless Ad Hoc and Sensor Networks: Acknowledgments , 2008 .

[22]  Abdo Y. Alfakih,et al.  On the uniqueness of Euclidean distance matrix completions: the case of points in general position , 2005 .

[23]  Panos M. Pardalos,et al.  Multiscale Optimization Methods and Applications , 2014 .

[24]  R. Farebrother.  Three theorems with applications to euclidean distance matrices , 1987 .

[25]  John C. Gower.  Distance matrices and their Euclidean approximation , 1983 .

[26]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.

[27]  M. Laurent.  A connection between positive semidefinite and euclidean distance matrix completion problems , 1998 .

[28]  Stephen A. Vavasis,et al.  Nuclear norm minimization for the planted clique and biclique problems , 2009, Math. Program..

[29]  Paul Tseng,et al.  Second-Order Cone Programming Relaxation of Sensor Network Localization , 2007, SIAM J. Optim..

[30]  Krishan Rana,et al.  An Optimization Approach , 2004 .

[31]  Le Thi Hoai An,et al.  Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach , 2003, SIAM J. Optim..

[32]  A. Householder,et al.  Discussion of a set of points in terms of their mutual distances , 1938 .

[33]  Anthony Man-Cho So,et al.  Theory of semidefinite programming for Sensor Network Localization , 2005, SODA '05.

[34]  Etienne de Klerk,et al.  On the Convergence of the Central Path in Semidefinite Optimization , 2002, SIAM J. Optim..

[35]  Gordon M. Crippen,et al.  Chemical distance geometry: Current realization and future projection , 1991 .

[36]  H. Wolkowicz,et al.  Matrix Completion Problems , 2000 .

[37]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[38]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[39]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[40]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[41]  Masakazu Kojima,et al.  Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems , 2012, TOMS.

[42]  Christopher Rose.  Proceedings of the 7th annual international conference on Mobile computing and networking , 2001, MobiCom 2001.

[43]  J. J. Moré,et al.  Global continuation for distance geometry problems , 1995 .

[44]  Stephen P. Boyd,et al.  Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization , 2008, SIAM J. Optim..

[45]  Kim-Chuan Toh,et al.  An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization , 2009, SIAM J. Sci. Comput..

[46]  Jorge J. Moré,et al.  Distance Geometry Optimization for Protein Structures , 1999, J. Glob. Optim..

[47]  P. Schönemann,et al.  A generalized solution of the orthogonal procrustes problem , 1966 .

[48]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[49]  Di Wu,et al.  An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data , 2003, J. Glob. Optim..

[50]  Y. Ye,et al.  A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network Localization , 2006 .

[51]  P. Tarazaga,et al.  CIRCUM-EUCLIDEAN DISTANCE MATRICES AND FACES , 1996 .

[52]  Alfred O. Hero,et al.  Distributed weighted-multidimensional scaling for node localization in sensor networks , 2006, TOSN.

[53]  Katya Scheinberg,et al.  Interior Point Trajectories in Semidefinite Programming , 1998, SIAM J. Optim..

[54]  Henry Wolkowicz,et al.  Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming , 1999, Comput. Optim. Appl..

[55]  Monique Laurent,et al.  Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems , 2000, SIAM J. Matrix Anal. Appl..

[56]  B. Hendrickson.  The Molecular Problem: Determining Conformation from Pairwise Distances , 1990 .

[57]  Andrea Cassioli.  Solving the Sensor Network Localization Problem using an Heuristic Multistage Approach , 2010 .

[58]  Paul Tseng,et al.  (Robust) Edge-based semidefinite programming relaxation of sensor network localization , 2011, Math. Program..

[59]  Maria Belk,et al.  Realizability of Graphs in Three Dimensions , 2007, Discret. Comput. Geom..

[60]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[61]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[62]  Bruce Hendrickson,et al.  The Molecule Problem: Exploiting Structure in Global Optimization , 1995, SIAM J. Optim..

[63]  Robert Connelly,et al.  Realizability of Graphs , 2007, Discret. Comput. Geom..

[64]  H. Wolkowicz,et al.  Euclidean distance matrices, semidefinite programming and sensor network localization , 2011 .

[65]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[66]  J. Gower.  Euclidean Distance Geometry , 1982 .

[67]  Xiang-Yang Li.  Wireless Ad Hoc and Sensor Networks: Topology Control and Clustering , 2008 .

[68]  Masakazu Kojima,et al.  User Manual for SFSDP: a Sparse Version of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems , 2009 .

[69]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[70]  Holly Hui Jin,et al.  Scalable sensor localization algorithms for wireless sensor networks , 2005 .

[71]  Wei-Min Liu,et al.  The cone of distance matrices , 1991 .

[72]  Carlile Lavor,et al.  Extending the geometric build-up algorithm for the molecular distance geometry problem , 2008, Inf. Process. Lett..

[73]  Masakazu Kojima,et al.  Exploiting Sparsity in SDP Relaxation for Sensor Network Localization , 2009, SIAM J. Optim..

[74]  Brian D. O. Anderson,et al.  A Theory of Network Localization , 2006, IEEE Transactions on Mobile Computing.

[75]  W. Glunt,et al.  An alternating projection algorithm for computing the nearest euclidean distance matrix , 1990 .

[76]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[77]  Kim-Chuan Toh,et al.  A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation , 2008, SIAM J. Sci. Comput..

[78]  R. Saigal,et al.  Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .

[79]  Henry Wolkowicz,et al.  Strong Duality for Semidefinite Programming , 1997, SIAM J. Optim..

[80]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[81]  Michael A. Saunders,et al.  SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization , 2006, SIAM J. Optim..

[82]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[83]  Levent Tunçel,et al.  Invariance and efficiency of convex representations , 2007, Math. Program..

[84]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[85]  Xiang-Yang Li.  Wireless Ad Hoc and Sensor Networks: Theory and Applications , 2008 .

[86]  Anthony Man-Cho So,et al.  A semidefinite programming approach to tensegrity theory and realizability of graphs , 2006, SODA '06.

[87]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[88]  Tsenka Stoyanova,et al.  Evaluation of impact factors on RSS accuracy for localization and tracking applications in sensor networks , 2009, Telecommun. Syst..

[89]  Marc Teboulle,et al.  Iterative Minimization Schemes for Solving the Single Source Localization Problem , 2008, SIAM J. Optim..

[90]  N. Higham.  Computing the polar decomposition with applications , 1986 .

[91]  A. Alfakih.  Graph rigidity via Euclidean distance matrices , 2000 .

[92]  H. Wolkowicz,et al.  Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming , 2005 .

[93]  Kim-Chuan Toh,et al.  Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements , 2006, IEEE Transactions on Automation Science and Engineering.

[94]  Jiawang Nie,et al.  Sum of squares method for sensor network localization , 2006, Comput. Optim. Appl..

[95]  Alexander I. Barvinok,et al.  Problems of distance geometry and convex properties of quadratic maps , 1995, Discret. Comput. Geom..

[96]  Sarfraz Nawaz.  Anchor free localization for ad-hoc wireless sensor networks , 2008 .

[97]  Yunhao Liu,et al.  Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks , 2009, IEEE/ACM Transactions on Networking.

[98]  B. Green.  THE ORTHOGONAL APPROXIMATION OF AN OBLIQUE STRUCTURE IN FACTOR ANALYSIS , 1952 .

[99]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[100]  Jian Li,et al.  Exact and Approximate Solutions of Source Localization Problems , 2008, IEEE Transactions on Signal Processing.

[101]  Kazuo Murota,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework , 2000, SIAM J. Optim..

[102]  Leonard M. Blumenthal,et al.  Theory and applications of distance geometry , 1954 .

[103]  Ioannis Z. Emiris,et al.  Molecular conformation search by distance matrix perturbations , 2005 .

[104]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2009, TOSN.

[105]  Charles R. Johnson,et al.  Connections between the real positive semidefinite and distance matrix completion problems , 1995 .

[106]  James Aspnes,et al.  On the Computational Complexity of Sensor Network Localization , 2004, ALGOSENSORS.

[107]  Piotr Indyk,et al.  Low-Dimensional Embedding with Extra Information , 2004, SCG '04.

[108]  Emmanuel J. Candès,et al.  Matrix Completion With Noise , 2009, Proceedings of the IEEE.

[109]  Pablo Tarazaga,et al.  Faces of the cone of Euclidean distance matrices: Characterizations, structure and induced geometry , 2005 .

[110]  Qunfeng Dong,et al.  A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances , 2002, J. Glob. Optim..

[111]  Nathan Krislock,et al.  Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion , 2010 .

[112]  Yinyu Ye,et al.  Convergence behavior of interior-point algorithms , 1993, Math. Program..

[113]  Timothy F. Havel,et al.  The theory and practice of distance geometry , 1983, Bulletin of Mathematical Biology.

[114]  Yechiam Yemini,et al.  Some theoretical aspects of position-location problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[115]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[116]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[117]  Piotr Indyk,et al.  Low-Dimensional Embedding with Extra Information , 2006, Discret. Comput. Geom..

[118]  A. Alfakih.  On rigidity and realizability of weighted graphs , 2001 .

[119]  Charles R. Johnson,et al.  The Euclidian Distance Matrix Completion Problem , 1995, SIAM J. Matrix Anal. Appl..

[120]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[121]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[122]  Robert Michael Lewis,et al.  Molecular Embedding via a Second Order Dissimilarity Parameterized Approach , 2009, SIAM J. Sci. Comput..

[123]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[124]  M. Fréchet.  Sur La Definition Axiomatique D'Une Classe D'Espaces Vectoriels Distancies Applicables Vectoriellement Sur L'Espace de Hilbert , 1935 .

[125]  Di Wu,et al.  Rigid versus unique determination of protein structures with geometric buildup , 2008, Optim. Lett..

[126]  Weiyu Xu,et al.  Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization , 2008, 2008 47th IEEE Conference on Decision and Control.

[127]  KojimaMasakazu,et al.  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I , 2000 .

[128]  Abdo Y. Alfakih,et al.  On the uniqueness of Euclidean distance matrix completions , 2003 .