Journal of Global Optimization

, Volume 27, Issue 4, pp 375–397 | Cite as

Solving Large Scale Molecular Distance Geometry Problems by a Smoothing Technique via the Gaussian Transform and D.C. Programming

  • Le Thi Hoai An


We study a continuation approach via the Gaussian transform and D.C. programming for solving both exact and general distance geometry problems. This approach relies on a new formulation of the problems and their Gaussian transforms which are both smooth D.C. (difference of convex functions) programs. A D.C. optimization algorithm is investigated for solving the transformed problems. Numerical experiments on the data derived from PDB data bank up to 4189 atoms show the usefulness of the reformulation, the globality of sought solutions, the robustness and the efficiency of the proposed approach.

continuation method D.C. algorithm (DCA) distance geometry problems Gaussian transform molecular optimization reformulation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alfakih A., Khandani A. and Wolkowicz H. (1999) Solving Euclidean Distance Matrix Completion Problems via Semidefinite Programming, Computational Optimization and Applications, 12, 13–30.Google Scholar
  2. 2.
    Le Thi Hoai An (1997), Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algorithmes et Applications, Habilitation à Diriger des Recherches, Université de Rouen.Google Scholar
  3. 3.
    Le Thi Hoai An, Pham Dinh Tao (2000), D.C. programming approach for large scale molecular optimization via the general distance geometry problem, in the Special Issue ‘Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches’ Nonconvex Optimization and Its Applications, Kluwer Academic Publishers, 301–339.Google Scholar
  4. 4.
    Le Thi Hoai An and Pham Dinh Tao, (1999) DCA revisited and D.C. models of real world nonconvex optimization problems, To appear in Annals of Operations Research 2003.Google Scholar
  5. 5.
    Le Thi Hoai An, Pham Dinh Tao, Large Scale Molecular Optimization from distance matrices by a D.C. optimization approach, To appear in SIAM J. Optimization 2003.Google Scholar
  6. 6.
    Byrd R.H., Lu P., Nocedal J. And Zhu C. (1994) A limited memory algorithm for bound constrained optimization, Technical Report NAM-08, Departement of Electrical Engineering and Computer Science, Northwestern University.Google Scholar
  7. 7.
    Crippen G.M. & Havel T.F., Distance Geometry and Molecular Conformation, John Wiley & Sons,(1988), New York.Google Scholar
  8. 8.
    Floudas C., Adjiman C.S., Dallwig S. and Neumaier A., A Global Optimization Method, áBB, for General Twice Differentiable Constrained NLPs-I: Theoretical Advances, Computational Chemical Engineering 22 (1998), 11–37.Google Scholar
  9. 9.
    Glunt W., Hayden T.L. & Raydan M., Molecular Conformation from distance matrices, J. Comp. Chem. 14 (1993), 114–120.Google Scholar
  10. 10.
    Havel T.F., An evaluation of computational strategies for use in the determination of protein structure from distance geometry constraints obtained by nuclear magnetic resonance, Prog. Biophys. Mol. Biol., 56 (1991), 43–78.Google Scholar
  11. 11.
    Hendrickson B.A., The molecule problem: Exploiting structure in global optimization, SIAM J. Optimization, 5 (1995), 835–857.Google Scholar
  12. 12.
    Huang H.X., Liang Z.A. and Pardalos P., Some properties for the Euclidean Distance Matrix and Positive Semi-Definite Matrix Completion Problems, Department of Industrial and Systems Enegineering, University Florida, 2001.Google Scholar
  13. 13.
    More J.J. & Wu Z., Global continuation for distance geometry problems, SIAM J. Optimization, 8(1997), 814–836.Google Scholar
  14. 14.
    More J.J. & Wu Z., Issues in large-scale Molecular Optimization, preprint MCS-P539-1095, Argonne National Laboratory, Argonne, Illinois 60439, Mars 1996.Google Scholar
  15. 15.
    More J.J. & Wu Z., Distance geometry optimization for protein structures, Journal of Global Optimization, Vol. 15 (1999), 219–234.Google Scholar
  16. 16.
    Pham Dinh Tao, Algorithms for solving a class of non convex optimization problems. Methods of subgradients, Fermat days 85. Mathematics for Optimization, Elsevier Science Publishers B.V. North-Holland, (1986), 249–271.Google Scholar
  17. 17.
    Pham Dinh Tao and Bernoussi S.E., Duality in D.C. (difference of convex functions) optimization. Subgradient methods, Trends in Mathematical Optimization, International Series of Numer Math. Vol 84 (1988), Birkhauser, 277–293.Google Scholar
  18. 18.
    Pham Dinh Tao and Le Thi Hoai An, D.C. optimization algorithms for the trust region problem. SIAM J. Optimization, 8(2), (1998), 476–505.Google Scholar
  19. 19.
    Pham Dinh Tao and Le Thi Hoai An, Convex analysis approach to D.C. programming: Theory, Algorithms and Applications (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday), Acta Mathematica Vietnamica, 22(1), 1997, 289–355.Google Scholar
  20. 20.
    Rockafellar R.T., Convex Analysis, Princeton University, Princeton, 1970.Google Scholar
  21. 21.
    Zou Z., Richard. H. Bird, & Robert B. Schnabel, A Stochastic/Pertubation Global Optimization Algorithm for Distance Geometry Problems, J. of Global Optimization, 11(1997), 91–105.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Le Thi Hoai An
    • 1
  1. 1.Laboratory of Modelling, Optimization and Operations ResearchNational Institute for Applied Sciences-RouenMont Saint Aignan CedexFrance (e-mail

Personalised recommendations