A. Auger, Convergence results for (1,?)-SA-ES using the theory of ?-irreducible markov chains, Theoretical Computer Science, 2005.

A. Auger, M. Jebalia, and O. Teytaud, Xse: quasi-random mutations for evolution strategies, Proceedings of Evolutionary Algorithms, 2005.

L. Devroye, L. Györfi, and G. Lugosi, A probabilistic Theory of Pattern Recognition, 1997.
DOI : 10.1007/978-1-4612-0711-5

S. Droste, Not all linear functions are equally difficult for the compact genetic algorithm, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.679-686, 2005.
DOI : 10.1145/1068009.1068124

S. Droste, T. Jansen, and I. Wegener, Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization, Theory of Computing Systems, vol.39, issue.4, 2003.
DOI : 10.1007/s00224-004-1177-z

W. Feller, An introduction to Probability Theory and its Applications, 1968.

R. Hooke and T. A. Jeeves, `` Direct Search'' Solution of Numerical and Statistical Problems, Journal of the ACM, vol.8, issue.2, pp.212-229, 1961.
DOI : 10.1145/321062.321069

J. Jagerskupper and C. Witt, Runtime analysis of a (mu+1)es for the sphere function, 2005.

J. Nelder and R. Mead, A Simplex Method for Function Minimization, The Computer Journal, vol.7, issue.4, pp.308-311, 1965.
DOI : 10.1093/comjnl/7.4.308

G. Rudolph, Convergence rates of evolutionary algorithms for a class of convex objective functions, Control and Cybernetics, vol.26, issue.3, pp.375-390, 1997.

O. Teytaud, S. Gelly, and J. Mary, On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy, 2006.
DOI : 10.1007/11844297_4
URL : https://hal.archives-ouvertes.fr/inria-00112816