Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
From MaRDI portal
Recommendations
Cited in
(13)- Nonstationary Markov chains and convergence of the annealing algorithm
- 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
- Quantum annealing learning search for solving QUBO problems
- On the Ergodicity of Slow-Varying Nonstationary Markov Chains
- \(\Delta\)-ergodic theory and simulated annealing
- Simulated annealing with extended neighbourhood
- scientific article; zbMATH DE number 176097 (Why is no real title available?)
- scientific article; zbMATH DE number 1265023 (Why is no real title available?)
- Simulated Annealing Type Markov Chains and Their Order Balance Equations
- CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION
- Monte Carlo within simulated annealing for integral constrained optimizations
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Simulated annealing with asymptotic convergence for nonlinear constrained optimization
This page was built for publication: Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780216)