Hysteretic Optimization
arXiv:cond-mat/0109359 · doi:10.1103/PhysRevLett.89.150201
Abstract
We propose a new optimization method based on a demagnetization procedure well known in magnetism. We show how this procedure can be applied as a general tool to search for optimal solutions in any system where the configuration space is endowed with a suitable `distance'. We test the new algorithm on frustrated magnetic models and the traveling salesman problem. We find that the new method successfully competes with similar basic algorithms such as simulated annealing.
5 pages, 5 figures
Cited by in corpus (18)
- Direct observation of the ice rule in artificial kagome spin ice
- Artificial square ice and related dipolar nanoarrays
- Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations (from 2020 to 2024)
- Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity
- Energy minimization and AC demagnetization in a nanomagnet array
- Disorder strength and field-driven ground state domain formation in artificial spin ice: experiment, simulation and theory
- Coherent Ising machines -- Quantum optics and neural network perspectives
- Coherent Ising machines with error correction feedback
- Hysteretic optimization for the Sherrington-Kirkpatrick spin glass
- Phase transitions in a disordered system in and out of equilibrium
- Changeover from Glassy ferromagnetism of the orbital domain state to long range ferromagnetic ordering in La{_{0.9}}Sr_{0.1}MnO{_3}
- Ground state optimization and hysteretic demagnetization: the random-field Ising model
- Hysteretic Optimization For Spin Glasses
- Bio-inspired Optimization: metaheuristic algorithms for optimization
- Is demagnetization an efficient optimization method?
- Gradient dynamics in reinforcement learning
- Hysteresis loop signatures of phase transitions in a mean-field model of disordered Ising magnet
- Self-organized manifold learning and heuristic charting via adaptive metrics