Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion

Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion

Show other versions (1)

The main result of this thesis is the development of a theory of semidefinite facial reduction for the Euclidean distance matrix completion problem. Our key result shows a close connection between cliques in the graph of the partial Euclidean distance matrix and faces of the semidefinite cone conta...

Full description

Bibliographic Details
Main Author: Krislock, Nathan
Language:en
Published: 2010
Subjects:
Euclidean distance matrices
low-rank matrix completion
semidefinite relaxations
facial reduction
wireless sensor network localization
molecular conformation
Combinatorics and Optimization
Online Access:http://hdl.handle.net/10012/5093

Internet

http://hdl.handle.net/10012/5093

Similar Items