Best possible strategy for finding ground states.
Finding the ground state of a system with a complex energy landscape is important for many physical problems including protein folding, spin glasses, chemical clusters, and neural networks. Such problems are usually solved by heuristic search methods whose efficacy is judged by empirical performance on selected examples. We present a proof that, within the large class of algorithms that simulate a random walk on the landscape, threshold accepting is the best possible strategy. In particular, it can perform better than simulated annealing and Tsallis statistics. Our proof is the first example of a provably optimal strategy in this area.
Franz
A
A
Institut für Physik, Technische Universität, D-09107 Chemnitz, Germany.
Hoffmann
K H
KH
Salamon
P
P
D000465:Algorithms; D008962:Models, Theoretical