Dynamic Greedy Algorithms for the Edwards-Anderson Model
Disordered Systems and Neural Networks
2023-12-01 v1
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.
Cite
@article{arxiv.1802.04541,
title = {Dynamic Greedy Algorithms for the Edwards-Anderson Model},
author = {Stefan Schnabel and Wolfhard Janke},
journal= {arXiv preprint arXiv:1802.04541},
year = {2023}
}
Comments
9 pages, 10 figures