Discrete-time simulated annealing: a convergence analysis via the Eyring-Kramers law
DOI10.3934/naco.2024015MaRDI QIDQ6668662
Xun Yu Zhou, Yuhang Wu, Wenpin Tang
Publication date: 22 January 2025
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
simulated annealingconvergence ratefunctional inequalitiesoverdamped Langevin equationEuler discretizationEyring-Kramers law
Nonlinear programming (90C30) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Functional inequalities, including subadditivity, convexity, etc. (39B62) Computational methods for stochastic equations (aspects of stochastic analysis) (60H35) Numerical solutions to stochastic differential and integral equations (65C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Poincaré and logarithmic Sobolev inequalities by decomposition of the energy landscape
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Recuit simulé sur \(\mathbb{R}{}^ n\). Étude de l'évolution de l'énergie libre. (Simulated annealing on \(\mathbb{R}{}^ n\). Study of the evolution of free energy)
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
- Exponential convergence of Langevin distributions and their discrete approximations
- Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality
- Metastability in reversible diffusion processes. I: Sharp asymptotics for capacities and exit times
- Metastability in reversible diffusion processes. II: Precise asymptotics for small eigenvalues
- Is there an analog of Nesterov acceleration for gradient-based MCMC?
- Ergodicity of the infinite swapping algorithm at low temperature
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Diffusions for Global Optimization
- Diffusion for Global Optimization in $\mathbb{R}^n $
- Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
- The Total Tardiness Problem: Review and Extensions
- Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Nonconvex Stochastic Optimization: Nonasymptotic Performance Bounds and Momentum-Based Acceleration
- Sampling can be faster than optimization
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Tail probability estimates of continuous-time simulated annealing processes
This page was built for publication: Discrete-time simulated annealing: a convergence analysis via the Eyring-Kramers law