Nonstationary Markov chains and convergence of the annealing algorithm

DOI10.1007/BF01007975zbMath0642.60049MaRDI QIDQ1101782

Publication date: 1985

Published in: Journal of Statistical Physics (Search for Journal in Brave)

modelling nonlinear oscillators phase transitions chaotic systems manipulator control bond graph analysis convergence of the annealing algorithm in Monte Carlo simulations parameter and state identification variance of the sample-means estimator

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Classical equilibrium statistical mechanics (general) (82B05)

Related Items

Sufficient Conditions for Ergodicity and Convergence of MH, SA, and EM Algorithms, Limit set of inhomogeneous Ornstein-Uhlenbeck processes, destabilization and annealing, Stochastic gradient Hamiltonian Monte Carlo for non-convex learning, Statistics, images, and pattern recognition, Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Nonconvex Stochastic Optimization: Nonasymptotic Performance Bounds and Momentum-Based Acceleration, Mean square rates of convergence in the continuous time simulated annealing algorithm on ${\mathbb{R}}^ d$, On discrete inhomogeneous exit problems, A theoretical framework for simulated annealing, Remarks on the ergodicity of simulated annealing algorithms on a graph, Simulated annealing via Sobolev inequalities, Simulated annealing with extended neighbourhood, A combined multistart-annealing algorithm for continuous global optimization, Simulated annealing with noisy or imprecise energy measurements, CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION, Characteristic analysis and prevention on premature convergence in genetic algorithms, Annealing a genetic algorithm for constrained optimization, Sequential Monte Carlo simulated annealing, On the Generalized Langevin Equation for Simulated Annealing, On the Ergodicity of Slow-Varying Nonstationary Markov Chains, From simulated annealing to stochastic continuation: a new trend in combinatorial optimization, A limit theorem for pattern synthesis in image processing, A controlled search simulated annealing method for the single machine weighted tardiness problem, Asymptotics of the spectral gap with applications to the theory of simulated annealing, Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$, Convergence of a modified algorithm of fast probabilistic modeling, Stochastic techniques for global optimization: A survey of recent advances, A generalization of a result concerning the asymptotic behavior of finite Markov chains, Theory of genetic algorithms, Convergence of a random algorithm for function optimization, Some results characterizing the finite time behaviour of the simulated annealing algorithm., Geostatistical simulation of random fields with bivariate isofactorial distributions by adding mosaic models, Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy, Asymptotic behavior of some linear differential systems, Combinatorial optimization by stochastic automata, Laws of large numbers for the annealing algorithm, General local search methods, Simulated annealing and quantum detailed balance, Morgan's problem for a type of nonsquare systems, Simulated annealing with time-dependent energy function via Sobolev inequalities, A feedback algorithm for determining search parameters for Monte Carlo optimization, Linear analysis of genetic algorithms, Finite-Time Behavior of Slowly Cooled Annealing Chains, Stochastic Loss Aversion for Random Medium Access, Computational Experience with Generalized Simulated Annealing Over Continuous Variables, Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing, Minimization of $\ell_{1-2}$ for Compressed Sensing, Unnamed Item, Simulated annealing with time-dependent energy function

Cites Work