Log-linear convergence and optimal bounds for the (1 + 1)-ES

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4926 LNCS, Issue , 2008, Pages 207-218

  Jebalia, Mohamed ^a   Auger, Anne ^a   Liardet, Pierre ^b  

^a INRIA   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; COMPUTER SIMULATION; LINEAR SYSTEMS;

EXPLICIT LOG-LINEAR RATE; GENERAL ASSUMPTIONS; LAW OF LARGE NUMBERS; OPTIMAL BOUNDS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 44649138810     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79305-2_18     Document Type: Conference Paper

References (10)

1. Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart (1973)
2. Kern, S., Müller, S., Hansen, N., Büche, D., Ocenasek, J., Koumoutsakos, P.: Learning Probability Distributions in Continuous Evolutionary Algorithms - A Comparative Review. Natural Computing 3, 77-112 (2004)
3. Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation 9, 159-195 (2001)
4. Beyer, H.G.: The Theory of Evolution Strategies. Springer, Heidelberg (2001)
5. Bienvenüe, A., François, O.: Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. Theoretical Computer Science 306, 269-289 (2003)
6. Auger, A.: Convergence results for (1,λ)-SA-ES using the theory of φ-irreducible Markov chains. Theoretical Computer Science 334, 35-69 (2005)
7. Auger, A., Hansen, N.: Reconsidering the progress rate theory for evolution strategies in finite dimensions. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 445-452 (2006)
8. Teytaud, O., Gelly, S.S.: General lower bounds for evolutionary algorithms. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo- Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 21-31. Springer, Heidelberg (2006)
9. J̈agersküpper, J.: Lower bounds for hit-and-run direct search. In: Hromkovič, J., Královič, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol. 4665, pp. 118-129. Springer, Heidelberg (2007)
10. Loève, M.: Probability Theory, 3rd edn. Van Nostrand, New York (1963)