Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
From MaRDI portal
Publication:2373721
DOI10.1016/j.tcs.2007.02.042zbMath1149.90147OpenAlexW2121811374MaRDI QIDQ2373721
Publication date: 16 July 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.042
Related Items (26)
Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Multistart global optimization with tunnelling and an evolutionary strategy supervised by a martingale ⋮ Global linear convergence of evolution strategies with recombination on scaling-invariant functions ⋮ First Steps Towards a Runtime Analysis of Neuroevolution ⋮ Tuning soft mutations of the evolution algorithm for optimizing the linear solver parameters ⋮ Lower bounds from fitness levels made easy ⋮ A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation ⋮ Black-box search by unbiased variation ⋮ Free lunches on the discrete Lipschitz class ⋮ Precision, local search and unimodal functions ⋮ Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns ⋮ Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded ⋮ Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments ⋮ Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front ⋮ Oblivious Randomized Direct Search for Real-Parameter Optimization ⋮ Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances ⋮ Particle swarm optimization almost surely finds local optima ⋮ Drift conditions for estimating the first hitting times of evolutionary algorithms ⋮ Geometricity of genetic operators for real-coded representation ⋮ Lower bounds for randomized direct search with isotropic sampling ⋮ Multiplicative up-drift ⋮ Tight Bounds for Blind Search on the Integers and the Reals ⋮ Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions ⋮ A self-stabilizing algorithm for cut problems in synchronous networks ⋮ Efficient randomized test-and-set implementations ⋮ Analysis of particle interaction in particle swarm optimization
Cites Work
- Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties.
- On the analysis of the \((1+1)\) evolutionary algorithm
- Mathematical Foundations of Computer Science 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
