Rough large deviation estimates for simulated annealing: Application to exponential schedules
From MaRDI portal
Publication:1201163
DOI10.1214/aop/1176989682zbMath0755.60021OpenAlexW1976586958MaRDI QIDQ1201163
Publication date: 17 January 1993
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176989682
optimal convergence ratelarge deviation estimatesfixed cooling scheduleSimulated annealing algorithms
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Large deviations (60F10)
Related Items
About relaxation time of finite generalized Metropolis algorithms ⋮ Hitting time asymptotics for hard-core interactions on grids ⋮ Hypocoercivity in metastable settings and kinetic simulated annealing ⋮ Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling ⋮ Asymptotical behaviour of several interacting annealing processes ⋮ A Hybrid Method for Random Pattern Sequence Classification ⋮ The effect of multiple optima on the simple GA run-time complexity ⋮ An improved ant colony system for the sequential ordering problem ⋮ Stochastic local search for the FEATURE SET problem, with applications to microarray data ⋮ Some remarks on replicated simulated annealing ⋮ Metaheuristics: A bibliography ⋮ On the invariant measure of non-reversible simulated annealing ⋮ Mathematical aspects of the Digital Annealer's simulated annealing algorithm ⋮ Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing ⋮ The loop erased exit path and the metastability of a biased vote process ⋮ Mixing time and simulated annealing for the stochastic cellular automata ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing ⋮ Sufficient and necessary condition for the convergence of stochastic approximation algorithms ⋮ On simulated annealing with temperature-dependent energy and temperature-dependent communication ⋮ Large deviations for a class of nonhomogeneous Markov chains ⋮ Analysis of random restart and iterated improvement for global optimization with application to the traveling salesman problem ⋮ Fast parallel heuristics for the job shop scheduling problem ⋮ A stopping criterion for logarithmic simulated annealing ⋮ Some results characterizing the finite time behaviour of the simulated annealing algorithm. ⋮ Metastability in stochastic replicator dynamics ⋮ Stochastic protein folding simulation in the three-dimensional HP-model ⋮ How to Calculate the Barycenter of a Weighted Graph ⋮ A new genetic algorithm ⋮ A stochastic approach to full inverse treatment planning for charged-particle therapy ⋮ On the problem of exit from cycles for simulated annealing processes. A backward equation approach ⋮ Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms ⋮ The exit path of a Markov chain with rare transitions ⋮ Markov chains with exponentially small transition probabilities: First exit problem from a general domain. II: The general case. ⋮ Landscapes on spaces of trees ⋮ A new genetic algorithm specifically based on mutation and selection ⋮ Markovian perturbations of discrete iterations: Lyapunov functions, global minimization, and associative memory ⋮ Waiting times in evolutionary dynamics with time-decreasing noise ⋮ The convergence of stochastic algorithms solving flow shop scheduling
