Asymptotic convergence of genetic algorithms
From MaRDI portal
Publication:4209281
DOI10.1239/AAP/1035228082zbMATH Open0911.60018OpenAlexW1998296623MaRDI QIDQ4209281FDOQ4209281
Authors: Raphaël Cerf 
Publication date: 26 April 1999
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1035228082
Recommendations
Large deviations (60F10) Problems related to evolution (92D15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cited In (31)
- Genetic algorithms in random environments: two examples
- Manipulation of convergence in evolutionary systems
- Title not available (Why is that?)
- 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
- Particle methods: an introduction with applications
- The unified method analyzing convergence of genetic algorithms
- On the convergence rates of genetic algorithms
- Continuous dynamical system models of steady-state genetic algorithms
- Modeling genetic algorithms with interacting particle systems
- Sharp asymptotic results for simplified mutation-selection algorithms
- Asymptotic and pointwise stability of evolutionary algorithms
- A new genetic algorithm for solving nonconvex nonlinear programming problems
- Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
- Further improvements in the calculation of censored quantile regressions
- Mean convergence time of inhomogeneous genetic algorithm with elitism
- On stability and classification tools for genetic algorithms
- Multistage Markov chain modeling of the genetic algorithm and convergence results
- A Markov chain analysis of genetic algorithms: large deviation principle approach
- Title not available (Why is that?)
- Geometric Convergence and Concentration Inequalities for the Feynman–Kac Genetic Algorithm
- On the convergence of genetic algorithms -- a variational approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence conditions of genetic algorithms
- The elitist non-homogeneous genetic algorithm: almost sure convergence
- A weighted random walk model, with application to a genetic algorithm
- Numerical schemes and genetic algorithms for the optimal control of a continuous model of supply chains
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- A new genetic algorithm specifically based on mutation and selection
- On the foundations and the applications of evolutionary computing
This page was built for publication: Asymptotic convergence of genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209281)
