A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation

@article{Biswas2008ADS,
  title={A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation},
  author={Pratik Biswas and Kim-Chuan Toh and Yinyu Ye},
  journal={SIAM J. Scientific Computing},
  year={2008},
  volume={30},
  pages={1251-1277}
}
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior knowledge of the positions of any of the vertices. In our distributed algorithm, the graph is first subdivided into smaller subgraphs using intelligent clustering methods. Then a semidefinite programming relaxation and gradient search method is used to localize each subgraph. Finally, a stitching algorithm is used to find… CONTINUE READING
Highly Cited
This paper has 103 citations. REVIEW CITATIONS

8 Figures & Tables

Topics

Statistics

01020'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

104 Citations

Semantic Scholar estimates that this publication has 104 citations based on the available data.

See our FAQ for additional information.