A Distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation

SIAM Journal on Scientific Computing

Volumn 30, Issue 3, 2007, Pages 1251-1277

  Biswas, Pratik ^a   Toh, Kim Chuan ^b   Ye, Yinyu ^a  

^a Stanford University   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Anchor free graph realization; Molecular conformation; Semidefinite programming

Indexed keywords

CLUSTERING ALGORITHMS; CONFORMATIONS; DOMAIN KNOWLEDGE; MOLECULES; VAN DER WAALS FORCES;

ANCHOR-FREE; ANCHOR-FREE GRAPH REALIZATION; FREE GRAPHS; LARGE-SCALES; MOLECULAR CONFIGURATIONS; MOLECULAR CONFORMATION; PAIRWISE DISTANCES; PROTEIN MOLECULES; SEMI-DEFINITE PROGRAMMING; SUBGRAPHS;

PROTEINS;

EID: 55549138762     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/05062754X     Document Type: Article

References (40)

1. S. AL-HOMIDAN AND H. WOLKOWICZ, Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming. Linear Algebra Appl., 406 (2005), pp. 109-141.
2. A. Y. ALFAKIH, A. KHANDANI, AND H. WOLKOWICZ, Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl., 12 (1999). pp. 13-30.
3. S. J. BENSON, Y. YE, AND X. ZHANG. Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim., 10 (2000), pp. 443-481.
4. H. M. HERMAN, J. WESTBROOK, Z. FENG, G. GILLILAND, T. N. BHAT, H. WEISSIG, I. N. SHINDYALOV, AND P. E. BOURNE. The protein data bank. Nucleic Acids Res.. 28 (2000). pp. 235-242.
5. P. BISWAS, T.-C. LIANG, K.-C. TOH, T.-C. WANG, AND Y. YE, Semidefinite programming approaches for sensor network localization with noisy distance measurements, IEEE Trans. Automat. Sci. Engrg, Special Issue on Distributed Sensing, 3 (2006). pp. 360-371.
6. P. BISWAS, T.-C. LIANG, T.-C. WANG, AND Y. YE, Semidefinite programming based algorithms for sensor network localization, ACM Trans. Sensor Networks, 2 (2006), pp. 188-220.
7. P. BISWAS AND Y. YE, A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization, in Mutiscale Optimization Methods and Applications, W. W. Hager, S.-J. Huang, P. M. Pardalos, AND O. A. ProkopYEv, eds., Springer-Verlag, NY, 2006, pp. 69-82.
8. P. BISWAS AND Y. YE, Semidefinite programming for ad hoc wireless sensor network localization, in Proceedings of the Third International Symposium on Information Processing in Sensor Networks, ACM Press, New York, 2004, pp. 46-54.
9. S. BOYD, L. EL GHAOUI. E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.
10. S. BURER AND R. D. C. MONTEIRO, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Programming, 95 (2003), pp. 329-357.
11. M. W. CARTER, H. H. JIN, M. A. SAUNDERS, AND Y. YE, Spaseloc: An adaptive subproblem algorithm for scalable wireless sensor network localization, SIAM J. Optim., 17 (2006), pp. 1102-1128.
12. B. CHAZELLE, C. KINGSFORD, AND M. SINGH, The side-chain positioning problem: A semidefinite programming formulation with new rounding schemes, in Proceedings of the Paris C. Kanellakis Memorial Workshop on Principles of Computing & Knowledge (PCK50), ACM Press, New York, 2003, pp. 86-94.
13. G. CRIPPEN AND T. HAVEL, Distance Geometry and Molecular Conformation, Wiley, New York, 1988.
14. Q. DONG AND Z. WU, A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data, J. Global Optim., 26 (2003), pp. 321-333.
15. A. GEORGE AND J. W. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall Professional Technical Reference, Prentice-Hall, Englewood Cliffs, N.J., 1981.
16. N. GUEX AND M. C. PEITSCH, Swiss-model and the Swiss-Pdbviewer: An environment for comparative protein modeling, Electrophoresis. 18 (1997), pp. 2714-2723.
17. O. GÜJLER AND Y. YE, Convergence behavior of interior point algorithms, Math. Programming, 60 (1993), pp. 215-228.
18. T. F. HAVEL AND K. WÜTHRICH, An evaluation of the combined use of nuclear magnetic resonance and distance geometry for the determination of protein conformation in solution, J. Molec. Biol., 182 (1985), pp. 281-294.
19. B. A. HENDRICKSON, The Molecular Problem: Determining Conformation from Pairwise Distances, Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca., NJ, 1991.
20. G. IYENGAR, D. PHILLIPS, AND C. STEIN, Approximation algorithms for semidefinite packing problems with applications to maxcut and graph coloring, in Eleventh Conference on Integer Programming and Combinatorial Optimization, Berlin, 2005.
21. M. LAURENT, Matrix completion problems, The Encyclopedia of Optimization, 3 (2001), pp. 221-229.
22. P. BISWAS, T.-C. LIANG, T.-C. WANG, AND Y. YE, Semidefinite programming based algorithms for sensor network localization, ACM Trans. Sensor Networks, 2 (2006), pp. 188-220.
23. N. LINIAL, E. LONDON, AND Y. RABINOVICH, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15 (1995), pp. 215-245.
24. J. J. MORÉ AND Z. WU, Global continuation for distance geometry problems, SIAM J. Optim., 7 (1997), pp. 814-836.
25. J. J. MORÉ AND Z. WU, ∈-optimal Solutions to Distance Geometry Problems via Global Continuation, Preprint MCS-P520-0595, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1994.
26. R. REAMS, G. CHATHAM, W. K. GLUNT, D. MCDONALD, AND T. L. HAYDEN, Determining protein structure using the distance geometry program APA, Computers & Chemistry, 23 (1999), pp. 153-163.
27. A. M.-C. SO AND Y. YE, A semidefinite programming approach to tensegrity theory and realizability of graphs, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Miami, PL, SIAM, Philadelphia, 2006, pp. 766-775.
28. A. M.-C. SO AND Y. YE, Theory of semidefinite programming relaxation, for sensor network localization, Math. Programming, 109 (2007), pp. 367-384.
29. J. F. STURM, Using SeDuMi 1.02, A MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11 & 12 (1999), pp. 625-633.
30. K.-C. TOH, Solving large scale semidefiniie programs via an iterative solver on the augmented systems, SIAM J. Optim., 14 (2003), pp. 670-698.
31. M. W. TROSSET, Applications of multidimensional scaling to molecular conformation, Comput. Sci. Statist., 29 (1998), pp. 148-152.
32. M. W. TROSSET, Distance matrix completion by numerical optimization, Comput. Optim. Appl., 17 (2000), pp. 11-22.
33. M. W. TROSSET, Extensions of classical multidimensional scaling via, variable reduction, Comput. Statist., 17 (2002), pp. 147-162.
34. R. H. TÜTÜNCÜ, K. C. TOH, AND M. J. TODD, Solving semidefinite-quadratic-linear programs using SDPT3, Math. Programming, Ser. B, 95 (2003), pp. 189-217.
35. K. Q. WEINBERGER, F. SHA, AND L. K. SAUL, Learning a kernel matrix for nonlinear dimensionality reduction, in Proceedings of the Twenty-First International Conference on Machine Learning (ICML'04), ACM Press, New York, 2004, pp. 839-846.
36. G. A. WILLIAMS, J. M. DUGAN, AND R. B. ALTMAN, Constrained global optimization for estimating molecular structure from atomic distances, J. Comput. Biol., 8 (2001), pp. 523-547.
37. D. WU AND Z. WU, An updated geometric build-up algorithm for molecular distance geometry problems with sparse distance data, J. Global Optimization. 37 (2007), pp. 661-673.
38. K. VARADARAJAN, S. VENKATESH, Y. YE, AND J. ZHANG, Approximating the radii of point sets, SIAM J. Comput., 36 (2007), pp. 1764-1776.
39. J.-M. YOON, Y. GAD, AND Z. WU, Mathematical Modeling of Protein Structure Using Distance Geometry, in Numerical Linear Algebra and Optimization. Y. Yuan, ed., Scientific Press, Beijing, China, 2004.
40. Z. ZHANG AND H. ZHA, Principal manifolds and nonlinear dimensionality reduction via tangent space alignment, SIAM J. Sci. Comput., 26 (2004), pp. 313-338.