Y. Akimoto, Y. Nagata, I. Ono, and S. Kobayashi, Bidirectional Relation between CMA Evolution Strategies and Natural Evolution Strategies, Lecture Notes in Computer Science, vol.6238, pp.154-163, 2010.
DOI : 10.1007/978-3-642-15844-5_16

Y. Akimoto, A. Auger, and N. Hansen, Convergence of the Continuous Time Trajectories of Isotropic Evolution Strategies on Monotonic $\mathcal C^2$ -composite Functions, Parallel Problem Solving from Nature -PPSN XII, pp.42-51, 2012.
DOI : 10.1007/978-3-642-32937-1_5

C. Audet and J. Jr, Analysis of Generalized Pattern Searches, SIAM Journal on Optimization, vol.13, issue.3, pp.889-903, 2002.
DOI : 10.1137/S1052623400378742

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, Linear convergence on positively homogeneous functions of a comparison based step-size adaptive randomized search: the (1+1) ES with generalized one-fifth success rule, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00877161

H. Beyer and H. Schwefel, Evolution strategies ? a comprehensive introduction, Natural Computing, vol.1, issue.1, pp.3-52, 2002.
DOI : 10.1023/A:1015059928466

A. Bienvenüe and O. François, 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

S. Vivek and . Borkar, Stochastic approximation: a dynamical systems viewpoint, 2008.

D. Brockhoff, A. Auger, N. Hansen, D. V. Arnold, and T. Hohm, Mirrored Sampling and Sequential Selection for Evolution Strategies, Parallel Problem Solving from Nature , PPSN XI, pp.11-21, 2010.
DOI : 10.1007/978-3-642-15844-5_2
URL : https://hal.archives-ouvertes.fr/inria-00530202

P. Deuflhard, Newton methods for nonlinear problems: affine invariance and adaptive algorithms, 2011.
DOI : 10.1007/978-3-642-23899-4

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

T. Glasmachers, T. Schaul, Y. Sun, 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

W. Jessy, . Grizzle, I. Steven, and . Marcus, The structure of nonlinear control systems possessing symmetries. Automatic Control, IEEE Transactions on, vol.30, issue.3, pp.248-258, 1985.

N. Hansen, An Analysis of Mutative ??-Self-Adaptation on Linear Fitness Functions, Evolutionary Computation, vol.14, issue.3, pp.255-275, 2006.
DOI : 10.1109/4235.771163

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

N. Hansen, A. Ostermeier, and A. Gawelczyk, On the adaptation of arbitrary normal mutation distributions in evolution strategies: The generating set adaptation, pp.57-64, 1995.

N. Hansen, A. Atamna, and A. Auger, How to Assess Step-Size Adaptation Mechanisms in Randomised Search, Parallel Problem Solving from Nature PPSN XIII, pp.60-69, 2014.
DOI : 10.1007/978-3-319-10762-2_6
URL : https://hal.archives-ouvertes.fr/hal-00997294

N. Hansen and A. Auger, Principled Design of Continuous Stochastic Search: From Theory to Practice, Theory and Principled Methods for the Design of Metaheuristics, Natural Computing Series, pp.145-180, 2014.
DOI : 10.1007/978-3-642-33206-7_8
URL : https://hal.archives-ouvertes.fr/hal-00808450

N. Hansen, A. Auger, R. Ros, S. Finck, and P. Po?ík, Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009, Proceedings of the 12th annual conference comp on Genetic and evolutionary computation, GECCO '10, pp.1689-1696, 2010.
DOI : 10.1145/1830761.1830790
URL : https://hal.archives-ouvertes.fr/hal-00545727

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. Jägersküpper, Rigorous runtime analysis of the (1+1)-ES: 1/5-rule and ellipsoidal fitness landscapes, LNCS, editor, Foundations of Genetic Algorithms: 8th International Workshop, pp.260-281, 2005.

G. Kevin, R. Jamieson, B. Nowak, and . Recht, Query complexity of derivative-free optimization, Advances in Neural Information Processing Systems 25, pp.2672-2680, 2012.

M. Jebalia, A. Auger, and N. Hansen, Log-Linear Convergence and Divergence of??the??Scale-Invariant (1+1)-ES in Noisy Environments, Algorithmica, vol.13, issue.1, pp.425-460, 2011.
DOI : 10.1007/s00453-010-9403-3
URL : https://hal.archives-ouvertes.fr/inria-00433347

S. Kern, S. D. 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

J. Harold, G. Kushner, and . George-yin, Stochastic approximation and recursive algorithms and applications, 2003.

C. Jeffrey, B. Lagarias, M. H. Poonen, and . Wright, Convergence of the restricted nelder?mead algorithm in two dimensions, SIAM Journal on Optimization, vol.22, issue.2, pp.501-532, 2012.

C. Jeffrey, . Lagarias, A. James, . Reeds, H. Margaret et al., Convergence properties of the nelder?mead simplex method in low dimensions, SIAM Journal on optimization, vol.9, issue.1, pp.112-147, 1998.

M. Robert, V. Lewis, and . Torczon, Rank ordering and positive bases in pattern search A. AUGER AND N. HANSEN algorithms, 1996.

P. Martin, P. Rouchon, and J. Rudolph, Invariant tracking. ESAIM: Control, Optimisation and Calculus of Variations, pp.1-13, 2004.

I. Ken and . Mckinnon, Convergence of the nelder?mead simplex method to a nonstationary point, SIAM Journal on Optimization, vol.9, issue.1, pp.148-158, 1998.

S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability, 1993.

J. Ashworth, N. , and R. Mead, A simplex method for function minimization, The Computer Journal, pp.308-313, 1965.

Y. Nesterov and V. Spokoiny, Random Gradient-Free Minimization of Convex Functions, Foundations of Computational Mathematics, vol.66, issue.2, pp.1-40, 2015.
DOI : 10.1007/s10208-015-9296-2

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

I. Rechenberg, Evolutionstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, 1973.

I. Rechenberg, Evolutionsstrategie '94. Frommann-Holzboog Verlag, 1994.

M. Schumer and K. Steiglitz, Adaptive step size random search, IEEE Transactions on Automatic Control, vol.13, issue.3, pp.270-276, 1968.
DOI : 10.1109/TAC.1968.1098903
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.9779

H. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, Birkhäuser, 1977.
DOI : 10.1007/978-3-0348-5927-1

O. Shamir, On the complexity of bandit and derivative-free stochastic convex optimization, COLT 2013 -The 26th Annual Conference on Learning Theory, pp.3-24, 2013.

S. Stich, C. Müller, and B. Gärtner, Optimization of Convex Functions with Random Pursuit, SIAM Journal on Optimization, vol.23, issue.2, pp.1284-1309, 2013.
DOI : 10.1137/110853613

S. U. Stich, C. L. Müller, and B. Gärtner, Variable metric random pursuit, Mathematical Programming, pp.1-31, 2015.
DOI : 10.1007/s10107-015-0908-z

V. Torczon, On the Convergence of Pattern Search Algorithms, SIAM Journal on Optimization, vol.7, issue.1, pp.1-25, 1997.
DOI : 10.1137/S1052623493250780

A. Anatoly, A. Zhigljavsky, and . Zilinskas, Stochastic global optimization, volume 1 of Springer Optimization and its applications, 2008.