D. Arnold and H. G. Beyer, A general noise model and its effects on evolution strategy performance, IEEE Transactions on Evolutionary Computation, vol.10, issue.4, pp.380-391, 2005.
DOI : 10.1109/TEVC.2005.859467

S. Astete-morales, J. Liu, O. Teytaud, P. Legrand, M. M. Corsini et al., Log-log Convergence for Noisy Optimization, Lecture Notes in Computer Science, vol.8752, pp.16-28, 2014.
DOI : 10.1007/978-3-319-11683-9_2
URL : https://hal.archives-ouvertes.fr/hal-01107772

A. J. Booker, J. E. Dennis, . Jr, P. D. Frank, D. B. Serafini et al., Optimization Using Surrogate Objectives on a Helicopter Test Example, pp.49-58, 1998.
DOI : 10.1007/978-1-4612-1780-0_3

J. A. Caballero and I. E. Grossmann, An algorithm for the use of surrogate models in modular flowsheet optimization, AIChE Journal, vol.1, issue.10, 2008.
DOI : 10.1002/aic.11579

R. Coulom, CLOP: Confident Local Optimization for Noisy??Black-Box Parameter Tuning, Lecture Notes in Computer Science, vol.7168, pp.146-157, 2012.
DOI : 10.1007/978-3-642-31866-5_13
URL : https://hal.archives-ouvertes.fr/hal-00750326

S. Droste, Analysis of the (1 + 1) EA for a Noisy OneMax, Lecture Notes in Computer Science, vol.3102, pp.1088-1099, 2004.
DOI : 10.1007/978-3-540-24854-5_107

S. Droste, T. Jansen, and I. Wegener, On the analysis of the (1+1) evolutionary algorithm, Theoretical Computer Science, vol.276, issue.1-2, pp.51-81, 2002.
DOI : 10.1016/S0304-3975(01)00182-7

S. Droste, T. Jansen, and I. Wegener, Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization, Theory of Computing Systems, vol.39, issue.4, 2006.
DOI : 10.1007/s00224-004-1177-z

N. Ermolova and S. G. Haggman, Simplified bounds for the complementary error function; application to the performance evaluation of signal-processing systems, Proceedings of the 12th European Signal Processing Conference, pp.1087-1090, 2004.

V. Fabian, Stochastic Approximation of Minima with Improved Asymptotic Speed, The Annals of Mathematical Statistics, vol.38, issue.1, pp.191-200, 1967.
DOI : 10.1214/aoms/1177699070

W. J. Gutjahr, Runtime Analysis of an Evolutionary Algorithm for Stochastic Multi-Objective Combinatorial Optimization, Evolutionary Computation, vol.2439, issue.3, pp.395-421, 2012.
DOI : 10.1007/3-540-44719-9_22

V. Heidrich-meisner and C. Igel, Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553426

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

K. A. Jong, Genetic Algorithms Are NOT Function Optimizers, Proceedings of the 2 nd Conference on Parallel Problems Solving from Nature, pp.3-13, 1992.
DOI : 10.1016/B978-0-08-094832-4.50006-4

M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb, Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem, Lecture Notes in Computer Science, vol.2439, pp.44-53, 2002.
DOI : 10.1007/3-540-45712-7_5

S. J. Leary, A. Bhaskar, and A. J. Keane, A Derivative Based Surrogate Model for Approximating and Optimizing the Output of an Expensive Computer Simulation, Journal of Global Optimization, vol.30, issue.1, pp.39-58, 2004.
DOI : 10.1023/B:JOGO.0000049094.73665.7e

H. Muhlenbein, How genetic algorithms really work: Mutation and hillclimbing, PPSN, pp.15-26, 1992.

P. S. Oliveto and C. Witt, Simplified Drift Analysis for Proving Lower Bounds in??Evolutionary Computation, Algorithmica, vol.35, issue.2, pp.369-386, 2011.
DOI : 10.1007/s00453-010-9387-z

Y. S. Ong, K. Lum, P. B. Nair, D. Shi, and Z. Zhang, Global convergence of unconstrained and bound constrained surrogate-assisted evolutionary search in aerodynamic shape design, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., pp.1856-1863, 2003.
DOI : 10.1109/CEC.2003.1299898

A. Prugel-benett, J. Rowe, and J. Shapiro, Lower bounds on simple ea runtimes in noisy optimization, 2013.

C. Qian, Y. Yu, Y. Jin, and Z. H. Zhou, On the effectiveness of sampling for evolutionary optimization in noisy environments, in: Parallel Problem Solving from Nature?PPSN XIII, pp.302-311, 2014.

P. Rolet, O. Teytaud, C. Di-chio, S. Cagnoni, C. Cotta et al., Adaptive Noisy Optimization, Lecture Notes in Computer Science, vol.6024, pp.592-601, 2010.
DOI : 10.1007/978-3-642-12239-2_61
URL : https://hal.archives-ouvertes.fr/inria-00459017

P. Rolet and O. Teytaud, Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis, Lecture Notes in Computer Science, vol.6073, pp.97-110, 2010.
DOI : 10.1007/978-3-642-13800-3_8
URL : https://hal.archives-ouvertes.fr/inria-00437140

J. Scharnow, K. Tinnefeld, and I. Wegener, Fitness Landscapes Based on Sorting and Shortest Paths Problems, pp.10-1007, 2002.
DOI : 10.1007/3-540-45712-7_6

T. Storch, How randomized search heuristics find maximum cliques in planar graphs, Proceedings of the 8th annual conference on Genetic and evolutionary computation , GECCO '06, pp.567-574, 2006.
DOI : 10.1145/1143997.1144099