Author:
Akimoto Youhei,Auger Anne,Hansen Nikolaus
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Auger, A.: Convergence results for the (1, λ)-SA-ES using the theory of ϕ-irreducible Markov chains. Theoretical Computer Science 334(1-3), 35–69 (2005)
2. Jägersküpper, J.: Probabilistic runtime analysis of (1 + ,λ), ES using isotropic mutations. In: Proceedings of the 2006 Genetic and Evolutionary Computation Conference, GECCO 2006, pp. 461–468. ACM (2006)
3. Jägersküpper, J.: How the (1 + 1) ES using isotropic mutations minimizes positive definite quadratic forms. Theoretical Computer Science 361(1), 38–56 (2006)
4. Jägersküpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science 379(3), 329–347 (2007)
5. Arnold, L., Auger, A., Hansen, N., Ollivier, Y.: Information-geometric optimization algorithms: a unifying picture via invariance principles. arXiv:1106.3708v1 (2011)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献