Euclidean distance matrices, semidefinite programming and sensor network localization

DOI10.4171/PM/1881zbMath1223.51017OpenAlexW1989261534MaRDI QIDQ716240

Miguel F. Anjos, Henry Wolkowicz, Abdo Y. Alfakih, Veronica Piccialli

Publication date: 27 April 2011

Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/pm/1881

zbMATH Keywords

Euclidean distance matrix completionssensor network localizationfundamental problem of distance geometry semidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) General theory of distance geometry (51K05) Matrix completion problems (15A83)

Related Items

Structure methods for solving the nearest correlation matrix problem, A penalty method for rank minimization problems in symmetric matrices, Euclidean distance matrix completion problems, On conic QPCCs, conic QCQPs and completely positive programs, Two relaxation methods for rank minimization problems, A new graph parameter related to bounded rank positive semidefinite matrix completions, Comparing SOS and SDP relaxations of sensor network localization, Euclidean Distance Matrices and Applications, Iterative universal rigidity

Uses Software

• SFSDP
• SNLSDP

Cites Work

• Unnamed Item
• The rigidity of graphs. II
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• On dimensional rigidity of bar-and-joint frameworks
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• The Rigidity of Graphs
• The Euclidian Distance Matrix Completion Problem