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

J. Jägersküpper, Probabilistic runtime analysis of (1+, ?), ES using isotropic mutations, Proceedings of the 2006 Genetic and Evolutionary Computation Conference ? GECCO 2006, pp.461-468, 2006.

J. Jägersküpper, How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms, Theoretical Computer Science, vol.361, issue.1, pp.38-56, 2006.
DOI : 10.1016/j.tcs.2006.04.004

J. Jägersküpper, Algorithmic analysis of a basic evolutionary algorithm for continuous optimization, Theoretical Computer Science, vol.379, issue.3, pp.329-347, 2007.
DOI : 10.1016/j.tcs.2007.02.042

L. Arnold, A. Auger, N. Hansen, and Y. Ollivier, Information-geometric optimization algorithms: a unifying picture via invariance principles, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00601503

N. Hansen, S. D. Muller, and P. Koumoutsakos, Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES), Evolutionary Computation, vol.11, issue.1, pp.1-18, 2003.
DOI : 10.1162/106365601750190398

S. Baluja and R. Caruana, Removing the Genetics from the Standard Genetic Algorithm, Proceedings of the 12th International Conference on Machine Learning, 1995.
DOI : 10.1016/B978-1-55860-377-6.50014-1

A. Ostermeier, A. Gawelczyk, and N. Hansen, A Derandomized Approach to Self-Adaptation of Evolution Strategies, Evolutionary Computation, vol.2, issue.4, pp.369-380, 1994.
DOI : 10.1162/evco.1994.2.4.369

T. Glasmachers, T. Schaul, S. Yi, D. Wierstra, and J. Schmidhuber, Exponential natural evolution strategies, Proceedings of the 12th annual conference on Genetic and evolutionary computation, GECCO '10, pp.393-400, 2010.
DOI : 10.1145/1830483.1830557

G. G. Yin, G. Rudolph, and H. P. Schwefel, Establishing connections between evolutionary algorithms and stochastic approximation, Informatica, vol.1, pp.93-116, 1995.

G. G. Yin, G. Rudolph, and H. P. Schwefel, Analyzing the (1, ??) Evolution Strategy via Stochastic Approximation Methods, Evolutionary Computation, vol.47, issue.4, pp.473-489, 1996.
DOI : 10.1109/TAC.1977.1101561

H. J. Kushner and G. G. Yin, Stochastic approximation and recursive algorithms and applications, 2003.

L. Malagò, M. Matteucci, and G. Pistone, Towards the geometry of estimation of distribution algorithms based on the exponential family, Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms, FOGA '11, pp.230-242, 2011.
DOI : 10.1145/1967654.1967675

Y. Akimoto, Y. Nagata, I. Ono, and S. Kobayashi, Theoretical Foundation for CMA-ES from Information Geometry Perspective, Algorithmica, vol.71, issue.7???9, 2011.
DOI : 10.1007/s00453-011-9564-8

H. K. Khalil, Nonlinear systems, 2002.

V. S. Borkar, Stochastic approximation, Resonance, vol.8, issue.s.471012, 2008.
DOI : 10.1007/s12045-013-0136-x

S. Bonnabel, Stochastic Gradient Descent on Riemannian Manifolds, IEEE Transactions on Automatic Control, vol.58, issue.9, 2011.
DOI : 10.1109/TAC.2013.2254619
URL : http://arxiv.org/abs/1111.5280

H. Thorisson, Coupling, stationarity, and regeneration, 2000.
DOI : 10.1007/978-1-4612-1236-2