Mathematical aspects of the Digital Annealer's simulated annealing algorithm
From MaRDI portal
Publication:6140923
DOI10.1007/s10955-023-03179-3arXiv2303.08392OpenAlexW4388976821MaRDI QIDQ6140923
Noe Kawamoto, Bruno Hideki Fukushima-Kimura, Eitaro Noda, Akira Sakai
Publication date: 2 January 2024
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.08392
stochastic optimizationcombinatorial optimizationsimulated annealingIsing modelground statesQUBODigital Annealer
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Sharp large deviations estimates for simulated annealing algorithms
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- Non-negative matrices and Markov chains.
- Mixing time and simulated annealing for the stochastic cellular automata
- Random Perturbations of Dynamical Systems
- Convergence of an annealing algorithm
- Convergence and finite-time behavior of simulated annealing
- Cooling Schedules for Optimal Annealing
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- Equation of State Calculations by Fast Computing Machines
This page was built for publication: Mathematical aspects of the Digital Annealer's simulated annealing algorithm