Euclidean Distance Matrices and Applications
Nathan Krislock () and
Henry Wolkowicz ()
Additional contact information
Nathan Krislock: University of Waterloo
Henry Wolkowicz: University of Waterloo
Chapter Chapter 30 in Handbook on Semidefinite, Conic and Polynomial Optimization, 2012, pp 879-914 from Springer
Abstract:
Abstract 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.
Keywords: Chordal Graph; Unit Disk Graph; Completion Problem; Euclidean Distance Matrix; Principal Submatrix (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (4)
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-0769-0_30
Ordering information: This item can be ordered from
http://www.springer.com/9781461407690
DOI: 10.1007/978-1-4614-0769-0_30
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().