Y. Akimoto, A. Auger, and N. Hansen, Quality Gain Analysis of the Weighted Recombination Evolution Strategy on General Convex Quadratic Functions, Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA '17, pp.111-126, 2017.
DOI : 10.1007/11844297_3
URL : https://hal.archives-ouvertes.fr/hal-01516326

N. Hansen and S. Kern, Evaluating the CMA Evolution Strategy on Multimodal Test Functions, pp.282-291, 2004.
DOI : 10.1007/978-3-540-30217-9_29

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

D. V. Arnold, Optimal Weighted Recombination, Foundations of Genetic Algorithms -FOGA VIII, pp.215-237, 2005.
DOI : 10.1007/11513575_12
URL : http://users.cs.dal.ca/~dirk/docs/FOGA05.pdf

N. Hansen, A. S. Niederberger, L. Guzzella, and P. Koumoutsakos, A Method for Handling Uncertainty in Evolutionary Optimization With an Application to Feedback Control of Combustion, IEEE Transactions on Evolutionary Computation, vol.13, issue.1, pp.180-197, 2009.
DOI : 10.1109/TEVC.2008.924423
URL : https://hal.archives-ouvertes.fr/inria-00276216

T. Yamaguchi and Y. Akimoto, Benchmarking the novel CMA-ES restart strategy using the search history on the BBOB noiseless testbed, Proceedings of the Genetic and Evolutionary Computation Conference Companion on , GECCO '17, pp.1780-1787, 2017.
DOI : 10.1145/1570256.1570333

Y. Akimoto and N. Hansen, Online Model Selection for Restricted Covariance Matrix Adaptation, Nature -PPSN XIV, vol.9, issue.2, pp.3-13, 2016.
DOI : 10.1007/978-3-540-87700-4_30
URL : https://hal.archives-ouvertes.fr/hal-01333840

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

H. Beyer, Towards a theory of 'evolution strategies': Results for (1+, ?)-strategies on (nearly) arbitrary fitness functions, in: Parallel Problem Solving from, Nature -PPSN III, pp.58-67, 1994.

H. Beyer, The Theory of Evolution Strategies, Natural Computing Series, 2001.
DOI : 10.1007/978-3-662-04378-3

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

M. Jebalia, A. Auger, and P. Liardet, Log-Linear Convergence and Optimal Bounds for the (1???+???1)-ES, pp.207-218, 2008.
DOI : 10.1007/978-3-540-79305-2_18
URL : https://hal.archives-ouvertes.fr/inria-00173483

M. Jebalia and A. , Auger, Log-linear convergence of the scale-invariant (µ/µw, ?)-es and optimal µ for intermediate recombination for large population sizes, in: Parallel Problem Solving from, Nature - PPSN XI, pp.52-62, 2010.

A. Auger, Analysis of comparison-based stochastic continuous black-box optimization algorithms, Habilitation, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01468781

R. Ros and N. Hansen, A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity, Nature -PPSN X, pp.296-305, 2008.
DOI : 10.1007/978-3-540-87700-4_30
URL : https://hal.archives-ouvertes.fr/inria-00270901

I. Loshchilov, A computationally efficient limited memory CMA-ES for large scale optimization, Proceedings of the 2014 conference on Genetic and evolutionary computation, GECCO '14, pp.397-404, 2014.
DOI : 10.1145/2576768.2598294
URL : https://hal.archives-ouvertes.fr/hal-00981135

Y. Akimoto and N. Hansen, Projection-Based Restricted Covariance Matrix Adaptation for High Dimension, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO '16, pp.197-204, 2016.
DOI : 10.1007/978-3-540-87700-4_30
URL : https://hal.archives-ouvertes.fr/hal-01306551

D. V. Arnold, On the use of evolution strategies for optimising certain positive definite quadratic forms, Proceedings of the 9th annual conference on Genetic and evolutionary computation , GECCO '07, pp.634-641, 2007.
DOI : 10.1145/1276958.1277094

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

S. Finck and H. Beyer, Weighted recombination evolution strategy on a class of PDQF's, Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, FOGA '09, pp.1-12, 2009.
DOI : 10.1145/1527125.1527127

H. Beyer and A. Melkozerov, The Dynamics of Self-Adaptive Multirecombinant Evolution Strategies on the General Ellipsoid Model, IEEE Transactions on Evolutionary Computation, vol.18, issue.5, pp.764-778, 2014.
DOI : 10.1109/TEVC.2013.2283968

H. Beyer and M. Hellwig, The Dynamics of Cumulative Step Size Adaptation on the Ellipsoid Model, Evolutionary Computation, vol.4193, issue.1, pp.25-57, 2016.
DOI : 10.1007/978-3-0348-5927-1

A. Auger, D. Brockhoff, and N. Hansen, Mirrored sampling in evolution strategies with weighted recombination, Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO '11, pp.861-868, 2011.
DOI : 10.1145/2001576.2001694
URL : https://hal.archives-ouvertes.fr/inria-00612522

M. Jebalia and A. , Auger, Log-linear convergence of the scale-invariant (µ/µw, ?)-ES and optimal mu for intermediate recombination for large population, 2010.

O. Teytaud and S. Gelly, General Lower Bounds for Evolutionary Algorithms, pp.21-31, 2006.
DOI : 10.1007/11844297_3
URL : https://hal.archives-ouvertes.fr/inria-00112820

L. Devroye, Non-Uniform Random Variate Generation, 1986.
DOI : 10.1007/978-1-4613-8643-8

H. Beyer and M. Large, But Inherit Small! On the Analysis of Rescaled Mutations in ( ? 1, ? ?)-ES with Noisy Fitness Data, in: Parallel Problem Solving from, Nature -PPSN V, pp.109-118, 1998.

D. V. Arnold, Weighted multirecombination evolution strategies, Theoretical Computer Science, vol.361, issue.1, pp.18-37, 2006.
DOI : 10.1016/j.tcs.2006.04.003

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

A. Dasgupta, Asymptotic theory of statistics and probability, 2008.

H. Robbins, A Remark on Stirling's Formula, The American Mathematical Monthly, vol.62, issue.1, pp.26-29, 1955.
DOI : 10.2307/2308012

B. Laurent and P. Massart, Adaptive estimation of a quadratic functional of a density by model selection, ESAIM: Probability and Statistics, vol.28, pp.1302-1338, 2000.
DOI : 10.1214/aos/1015957395