2000 character limit reached
Dynamic Greedy Algorithms for the Edwards-Anderson Model (1802.04541v1)
Published 13 Feb 2018 in cond-mat.dis-nn
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.
Collections
Sign up for free to add this paper to one or more collections.