Evolutionary algorithms for continuous-space optimisation

DOI10.1080/00207721.2011.605963zbMath1307.93475OpenAlexW2045683757MaRDI QIDQ5172457

Mircea Agapie, Alexandru Agapie, Gheorghe H. Zbăganu

Publication date: 4 February 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2011.605963

zbMATH Keywords

convolution of distributionsrenewal processhitting timeMarkov transition functiondiscretization of Markov chainsevolutionary algorithms with continuous-state spacenon-commutative binomial

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Convergence analysis of the plant propagation algorithm for continuous global optimization ⋮ Theoretical analysis of steady state genetic algorithms

Cites Work

• Unnamed Item
• On the analysis of the \((1+1)\) evolutionary algorithm
• How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
• Transition functions for evolutionary algorithms on continuous state-space
• General Irreducible Markov Chains and Non-Negative Operators
• Stopped Random Walks
• A Note on the Convolution of Uniform Distributions
• Estimation of distribution algorithms on non-separable problems