A. Auger, Convergence results for the <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>??</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-SA-ES using the theory of <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>??</mml:mi></mml:math>-irreducible Markov chains, Theoretical Computer Science, vol.334, issue.1-3, pp.35-69, 2005.
DOI : 10.1016/j.tcs.2004.11.017

A. Auger and N. Hansen, Reconsidering the progress rate theory for evolution strategies in finite dimensions, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.445-452, 2006.
DOI : 10.1145/1143997.1144081

A. Bienvenue and O. Francois, Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties, Theoretical Computer Science, vol.306, issue.1-3, pp.269-289, 2003.
DOI : 10.1016/S0304-3975(03)00284-6

K. Boroczky and G. Wintsche, Covering the sphere by equal spherical balls. Discrete and Computational Geometry, pp.237-253, 2003.

T. Bk, Evolutionary Algorithms in theory and practice, 1995.

A. Eiben and J. Smith, Introduction to Evolutionary Computing, 2003.

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

S. Kern, S. Müller, N. Hansen, D. Bche, J. Ocenasek et al., Learning probability distributions in continuous evolutionary algorithms ??? a comparative review, Natural Computing, vol.3, issue.1, pp.77-112, 2004.
DOI : 10.1023/B:NACO.0000023416.59689.4e

I. Rechenberg, Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien des Biologischen Evolution, 1973.

O. Teytaud and S. Gelly, General Lower Bounds for Evolutionary Algorithms, 10 th International Conference on Parallel Problem Solving from Nature, 2006.
DOI : 10.1007/11844297_3
URL : https://hal.archives-ouvertes.fr/inria-00112820