### Abstract

We compare two implementations of a new algorithm called the pivot method for the location of the global minimum of a multiple minima problem. The pivot method uses a series of randomly placed probes in phase space, moving the worst probes to be near better probes iteratively until the system converges. The original implementation, called the "lowest energy pivot method," chooses the pivot probes with a probability based on the energy of the probe. The second approach, called the "nearest neighbor pivot method," chooses the pivot probes to be the nearest neighbor points in the phase space. We examine the choice of distribution by comparing the efficiency of the methods for Gaussian versus generalized q-distribution, based on the Tsallis entropy in the relocation of the probes. The two implementations of the method are tested with a series of test functions and with several Lennard-Jones clusters of various sizes. It appears that the nearest neighbor pivot method using the generalized q-distribution is superior to previous methods.

Original language | English |
---|---|

Pages (from-to) | 7170-7177 |

Number of pages | 8 |

Journal | Journal of Chemical Physics |

Volume | 106 |

Issue number | 17 |

Publication status | Published - 1 May 1997 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Atomic and Molecular Physics, and Optics

### Cite this

*Journal of Chemical Physics*,

*106*(17), 7170-7177.