Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming

Journal of Global Optimization

Volumn 27, Issue 4, 2003, Pages 375-397

  Hoai An, Le Thi ^a  

^a UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Continuation method; D.C. algorithm (DCA); Distance geometry problems; Gaussian transform; Molecular optimization; Reformulation

Indexed keywords

ALGORITHMS; FORTRAN (PROGRAMMING LANGUAGE); MATHEMATICAL PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; MOLECULAR STRUCTURE; OPTIMIZATION; THEOREM PROVING;

CONTINUATION METHOD; DIFFERENCE OF CONVEX FUNCTIONS PROGRAMMING; DISTANCE GEOMETRY PROBLEMS; GAUSSIAN TRANSFORM; MOLECULAR OPTIMIZATION; SMOOTHING TECHNIQUE;

PROBLEM SOLVING;

EID: 0242485191     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026016804633     Document Type: Article

References (21)

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.
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.
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.
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.
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.
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.
7. Crippen G.M & Havel T.F., Distance Geometry and Molecular Conformation, John Wiley & Sons, (1988), New York.
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.
9. Glunt W., Hayden T.L. & Raydan M., Molecular Conformation from distance matrices, J. Comp. Chem. 14 (1993), 114-120.
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.
11. Hendrickson B.A., The molecule problem: Exploiting structure in global optimization, SIAM J. Optimization, 5(1995), 835-857.
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 Engineering, University Florida, 2001.
13. More J.J. & Wu Z., Global continuation for distance geometry problems, SIAM J. Optimization, 8(1997), 814-836.
14. More J.J. & Wu Z., Issues in large-scale Molecular Optimization, preprint MCS-P539-1095, Argonne National Laboratory, Argonne, Illinois 60439, Mars 1996.
15. More J.J. & Wu Z., Distance geometry optimization for protein structures, Journal of Global Optimization, Vol. 15 (1999), 219-234.
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.
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.
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.
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.
20. Rockafellar R.T., Convex Analysis, Princeton University, Princeton, 1970.
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.