Skip to main content
Log in

Improvement on the northby algorithm for molecular conformation: Better solutions

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In 1987, Northby presented an efficient lattice based search and optimization procedure to compute ground states ofn-atom Lennard-Jones clusters and reported putative global minima for 13⩽n⩽150. In this paper, we introduce simple data structures which reduce the time complexity of the Northby algorithm for lattice search fromO(n5/3) per move toO(n2/3) per move for ann-atom cluster involving full Lennard-Jones potential function. If nearest neighbor potential function is used, the time complexity can be further reduced toO(logn) per move for ann-atom cluster. The lattice local minimizers with lowest potential function values are relaxed by a powerful Truncated Newton algorithm. We are able to reproduce the minima reported by Northby. The improved algorithm is so efficient that less than 3 minutes of CPU time on the Cray-XMP is required for each cluster size in the above range. We then further improve the Northby algorithm by relaxingevery lattice local minimizer found in the process. This certainly requires more time. However, lower energy configurations were found with this improved algorithm forn=65, 66, 75, 76, 77 and 134. These findings also show that in some cases, the relaxation of a lattice local minimizer with a worse potential function value may lead to a local minimizer with a better potential function value.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. P. Brunet, A. Edelman, and J. P. Mesirov (1990), An Optimal Hypercube DirectN-body Solver on the Connection Machine, Proceedings of Superconducting '90, pp. 748–752, IEEE Computer Society Press.

  2. R. H. Byrd, E. Eskow, R. B. Schnabel, and S. L. Smith (1991), Parallel Global Optimization: Numerical Methods, Dynamic Scheduling Methods, and Application to Molecular Configuration, Technical Report CU-CS-553-91, University of Colorado at Boulder, Department of Computer Science, Boulder, CO.

    Google Scholar 

  3. J. H. Conway and N. J. A. Sloane (1988),Sphere Packings, Lattices and Groups, Springer-Verlag.

  4. J. Farges, M. F. De Feraudy, B. Raoult, and G. Torchet (1985), Cluster Models Made of Double Icosahedron Units,Surface Science 156, 370–378.

    Google Scholar 

  5. I. Z. Fisher, (1964),Statistical Theory of Liquids, Chicago and London.

  6. D. G. Garrett, K. D. Kastella, and D. M. Ferguson, New Results on Protein Folding from Simulated Annealing, submitted toJournal of the American Chemistry Society, 1992.

  7. M. R. Hoare (1979), Structure and Dynamics of Simple Microclusters,Advances in Chemical Physics 40, 49–135.

    Google Scholar 

  8. J. Danna Honeycutt and Hans C. Andersen (1987), Molecular Dynamics Study of Melting and Freezing of Small Lennard-Jones Clusters,Journal of Physical Chemistry 91, 4950–4963.

    Google Scholar 

  9. E. Horowitz and S. Sahni (1990),Data Structures in Pascal, Computer Science Press.

  10. R. S. Judson, M. E. Colvin, J. C. Meza, A. Huffer, and D. Gutierrez (1991), Do Intelligent Configuration Search Techniques Outperform Random Search for Large Molecules?, Sandia Report SAND91-8740, Sandia National Laboratories, Center for Computational Engineering, Livermore, CA.

    Google Scholar 

  11. R. S. Maier, J. B. Rosen, and G. L. Xue (1992), A Discrete-Continuous Algorithm for Molecular Energy Minimization, in Proceedings of the 1992 IEEE/ACM Supercomputing Conference, Minneapolis, MN, November 16–20, 1992, pp. 778–786. Also available as Army High Performance Computing Research Center Preprint 92-31, University of Minnesota, Minneapolis.

  12. C. D. Maranas and C. A. Floudas (1992), Global Optimization of Lennard-Jones Microclusters,Journal of Chemical Physics 97(10), 7667.

    Google Scholar 

  13. C. D. Maranas and C. A. Floudas (1993), Global Optimization for Molecular Conformation Problems,Annals of Operations Research, in press (1993).

  14. S. G. Nash (1984), User's Guide for TN/TNBC: Fortron Routines for Nonlinear Optimization, Report 397, Mathematical Sciences Department, The Johns Hopkins University.

  15. S. G. Nash (1985), Preconditioning of Truncated-Newton Methods,SIAM Journal on Scientific and Statistic Computing 6, 599–616.

    Google Scholar 

  16. J. A. Northby (1987), Structure and Binding of Lennard-Jones Clusters: 13 ⩽n⩽ 147,Journal of Chemical Physics 87, 6166–6178.

    Google Scholar 

  17. D. R. Ripoll and S. J. Thomas (1990), A Parallel Monte Carlo Search Algorithm for the Conformational Analysis of Proteins, Proceedings ACM/IEEE Superconducting '90, pp. 94–102.

  18. T. Schlick and M. Overton (1987), A Powerful Truncated Newton Method for Potential Energy Minimization,Journal of Computational Chemistry 8, 1025–1039.

    Google Scholar 

  19. David Shalloway (1991),Packet Annealing: A Deterministic Method for Global Minimization, Application to Molecular Conformation, Recent Advances in Global Optimization, C. Floudas and P. Pardalos, eds. Princeton University Press: Princeton, NJ.

    Google Scholar 

  20. D. G. Vlachlos, L. D. Schmidt, and R. Aris (1991), Structures of Small Metal Clusters: Phase Transitions and Isomerization, Army High Performance Computing Research Center Preprint 91-69, University of Minnesota, Minneapolis.

    Google Scholar 

  21. D. G. Vlachos, L. D. Schmidt, and R. Aris (1991), Structures of Small Metal Clusters: Low Temperature Behavior, Army High Performance Computing Research Center Preprint 91-70, University of Minnesota, Minneapolis.

    Google Scholar 

  22. L. T. Wille (1987), Minimum-Energy Configurations of Atomic Clusters: New Results Obtained by Simulated Annealing,Chemical Physics Letters 133, 405–410.

    Google Scholar 

  23. G. L. Xue, R. S. Maier, and J. B. Rosen (1991), Minimizing the Lennard-Jones Potential Function on a Massively Parallel Computer, in Proceedings of the 1992 ACM International Conference on Supercomputing, Washington, DC., July 19–23, 1992, pp. 409–416. Also available as Preprint 91-115, Army High Performance Computing Research Center, University of Minnesota, Minneapolis, Decemter 1991.

    Google Scholar 

  24. G. L. Xue (1992), Parallel Two-Level Simulated Annealing: Applications to Molecular Conformation, Preprint 92-047, Army High Performance Computing Research Center, University of Minnesota, Minneapolis, April 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xue, G. Improvement on the northby algorithm for molecular conformation: Better solutions. J Glob Optim 4, 425–440 (1994). https://doi.org/10.1007/BF01099267

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01099267

Key words

Navigation