Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion
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...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/5093 |