Le Thi Hoai An: "Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and d.c. programming".

Abstract: 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.

 

Keywords: continuation method, D.C. algorithm (DCA), distance geometry probroblems, Gaussian transform, molecular optimization, reformulation.

 

Citation: Le Thi Hoai An, Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and d.c. programming, Journal of Global Optimization, Vol 27, No. 4, pp. 375-397, 2003. 

 

Download link