Basin-hopping
In applied mathematics, Basin-hopping is a global optimization technique that iterates by performing random perturbation of coordinates, performing local optimization, and accepting or rejecting new coordinates based on a minimized function value. The algorithm was described in 1997 by David J. Wales and . It is a particularly useful algorithm for global optimization in very high-dimensional landscapes, such as finding the minimum energy structure for molecules. Inspired from Monte-Carlo Minimization first suggested by Li and Scheraga.
Link from a Wikipage to another Wikipage
primaryTopic
Basin-hopping
In applied mathematics, Basin-hopping is a global optimization technique that iterates by performing random perturbation of coordinates, performing local optimization, and accepting or rejecting new coordinates based on a minimized function value. The algorithm was described in 1997 by David J. Wales and . It is a particularly useful algorithm for global optimization in very high-dimensional landscapes, such as finding the minimum energy structure for molecules. Inspired from Monte-Carlo Minimization first suggested by Li and Scheraga.
has abstract
In applied mathematics, Basin- ...... suggested by Li and Scheraga.
@en
Wikipage page ID
57,184,342
page length (characters) of wiki page
Wikipage revision ID
991,199,559
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In applied mathematics, Basin- ...... suggested by Li and Scheraga.
@en
label
Basin-hopping
@en