Adaptive simulated annealing (ASA): Lessons learned
Lester Ingber
Abstract
Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using other previous simulated annealing algorithms. The author's ASA code has been publicly available for over two years. During this time the author has volunteered to help people via e-mail, and the feedback obtained has been used to further develop the code. Some lessons learned, in particular some which are relevant to other simulated annealing algorithms, are described.
Create a lesson
Related papers
asdex: Automatic Sparse Differentiation in JAX
Adrian Hill, Guillaume Dalle
Scen-Opt: A Scenario Optimization Toolbox for Data-Driven Convex Programming
Ben Wooding, Simone Garatti, Marco C. Campi et al.
A performance enhancement of the Payne-Hanek range reduction algorithm
Tue Ly
DistributedDesignOptimizer: A modular Python framework for Setup, Execution and Processing of Distributed Design Optimization
Sebastian Ellmaier, Albert J. de Wit, Akilesh Raveendran et al.
KnottedGraph: Scalable knotted-graph topology for scientific and mathematical discovery
Hakan Akgün, Xianquan Yan, Kehan Liu et al.
AWE: Adaptive Weight Encoding for Exact Integer Matrix Products with Fewer GEMMs on FP4 Tensor Cores
Shun-ichiro Hayashi, Daichi Mukunoki, Tetsuya Hoshino et al.