Dynamic Greedy Algorithms for the Edwards-Anderson Model
arXiv:1802.04541 · doi:10.1016/j.cpc.2017.06.019
Abstract
To provide a novel tool for the investigation of the energy landscape of the Edwards-Anderson spin-glass model we introduce an algorithm that allows an efficient execution of a greedy optimization based on data from a previously performed optimization for a similar configuration. As an application we show how the technique can be used to perform higher-order greedy optimizations and simulated annealing searches with improved performance.
arXiv comment9 pages, 10 figures
References in corpus (6)
- Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
- An efficient, multiple range random walk algorithm to calculate the density of states
- Exchange Monte Carlo Method and Application to Spin Glass Simulations
- Multicanonical Ensemble: A New Approach to Simulate First-order Phase Transitions
- Comparing Monte Carlo methods for finding ground states of Ising spin glasses: population annealing, simulated annealing and parallel tempering
- Cluster-Exact Approximation of Spin Glass Groundstates