How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms

@article{Jgerskpper2006HowT,
  title={How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms},
  author={Jens J{\"a}gersk{\"u}pper},
  journal={Theor. Comput. Sci.},
  year={2006},
  volume={361},
  pages={38-56}
}
The (1+1) evolution strategy (ES), a simple, mutation-based evolutionary algorithm for continuous optimization problems, is analyzed. In particular, we consider the most common type of mutations, namely Gaussian mutations, and the 5 -rule for mutation adaptation, and we are interested in how the runtime/number of function evaluations to obtain a predefined reduction of the approximation error depends on the dimension of the search space. The most discussed function in the area of ES is the so… CONTINUE READING
Highly Cited
This paper has 75 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

Parallel Problem Solving from Nature – PPSN XV

Lecture Notes in Computer Science • 2018
View 3 Excerpts
Method Support

75 Citations

0510'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.