A. Auger, Benchmarking the (1+1) Evolution Strategy with One-Fifth Success Rule on the BBOB, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00430515

S. H. Brooks, A Discussion of Random Methods for Seeking Maxima, Operations Research, vol.6, issue.2, pp.244-251, 1958.
DOI : 10.1287/opre.6.2.244

L. Devroye, The compund random search, International Symposium on Systems Engineering and Analysis, pp.195-110, 1972.

S. Finck, N. Hansen, R. Ros, and A. Auger, Real-parameter black-box optimization benchmarking 2009: Presentation of the noiseless functions, 2009.

N. Hansen, A. Auger, S. Finck, and R. Ros, Real-parameter black-box optimization benchmarking 2009: Experimental setup, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00362649

N. Hansen, S. Finck, R. Ros, and A. Auger, Real-parameter black-box optimization benchmarking 2009: Noiseless functions definitions, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00362633

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, pp.159-195, 2001.
DOI : 10.1016/0004-3702(95)00124-7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Igel, T. Suttorp, and N. Hansen, A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.453-460, 2006.
DOI : 10.1145/1143997.1144082

S. Kern, S. Müller, N. Hansen, D. Büche, 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

M. Schumer and K. Steiglitz, Adaptive step size random search. Automatic Control, IEEE Transactions on, vol.13, pp.270-276, 1968.
DOI : 10.1109/tac.1968.1098903

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=