Theory of Evolution Strategies: A New Perspective

Theory of Randomized Search Heuristics: Foundations and Recent Developments

Volumn , Issue , 2011, Pages 289-325

  Auger, Anne ^a   Hansen, Nikolaus ^a  

^a INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85129099170     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789814282673-10     Document Type: Chapter

References (31)

1. Auger, A. (2005). Convergence results for (1,A)-SA-ES using the theory of ip- irreducible markov chains, Theoretical Computer Science 334, pp. 35-69.
2. Auger, A. and Hansen, N. (2006). Reconsidering the progress rate theory for evolution strategies in finite dimensions, in A. Press (ed.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 445-452.
3. Baba, N. (1981). Convergence of random optimization methods for constrained optimization methods, Journal of Optimization Theory and Applications.
4. Beyer, H.-G. (2001). The Theory of Evolution Strategies, Natural Computing Series (Springer-Verlag).
5. Bienveniie, A. and Francois, O. (2003). Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties, Theoretical Computer Science 306, 1-3, pp. 269-289.
6. Brooks, S. (1958). A discussion of random methods for seeking maxima, The computer journal 6, 2.
7. Devroye, L. (1972). The compound random search, in International Symposium on Systems Engineering and Analysis (Purdue University), pp. 195-110.
8. Devroye, L. and KrzyZak, A. (2002). Random search under additive noise, in P. L. M. Dror and F. Szidarovsky (eds.), Modeling Uncertainty (Kluwer Academic Publishers), pp. 383-418.
9. Greenwood, G. W. and Zhu, Q. J. (2001). Convergence in evolutionary programs with self-adaptation, Evolutionary Computation 9, 2, pp. 147-157.
10. Hansen, N. and Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies, Evolutionary Computation 9, 2, pp. 159-195.
11. Jagerskupper, J. (2005). Rigorous runtime analysis of the (1+1)-ES: 1/5-rule and ellipsoidal fitness landscapes, in LNCS (ed.), Foundations of Genetic Algorithms: 8th International Workshop, FoGA 2005, Vol. 3469, pp. 260-281.
12. Jagerskupper, J. (2007). Analysis of a simple evolutionary algorithm for minimization in euclidean spaces, Theoretical Computer Science 379, 3, pp. 329-347.
13. Jagerskupper, J. (2008). Lower bounds for randomized direct search with isotropic sampling, Operations research letters 36, 3, pp. 327-332.
14. Jagerskupper, J. and Preuss, M. (2008). Aiming for a theoretically tractable CSA variant by means of empirical investigations, in Proceedings of the 2008 Conference on Genetic and Evolutionary Computation, pp. 503-510.
15. Jebalia, M., Auger, A. and Hansen, N. (2009). Log-linear convergence and divergence of the scale-invariant (1+1)-ES in noisy environments, Algorithmica In press.
16. Jebalia, M., Auger, A. and Liardet, P. (2008). Log-linear convergence and optimal bounds for the (1+1)-ES, in N. Monmarche and al. (eds.), Proceedings of Evolution Artificielle (EA’07), LNCS, Vol. 4926 (Springer), pp. 207-218.
17. Karr, A. F. (1993). Probability, Springer Texts in Statistics (Springer-Verlag).
18. Kern, S., Muller, S., Hansen, N., Buche, D., Ocenasek, J. and Koumoutsakos, P. (2004). Learning Probability Distributions in Continuous Evolutionary Algorithms - A Comparative Review, Natural Computing 3, 1, pp. 77-112.
19. Matyas, J. (1965). Random optimization, Automation and Remote control 26, 2.
20. Meyn, S. and Tweedie, R. (1993). Markov Chains and Stochastic Stability (Springer-Verlag, New York).
21. Nekrutkin, V. and Tikhomirov, A. (1993). Speed of convergence as a function of given accuracy for random search methods, Acta Applicandae Mathematicae 33, pp. 89-108.
22. Rechenberg, I. (1973). Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biologischen Evolution (Frommann-Holzboog Verlag, Stuttgart).
23. Rudolph, G. U. (2001). Self-adaptive mutations may lead to premature convergence, IEEE Transactions on Evolutionary Computation 5, pp. 410-414.
24. Schumer, M. and Steiglitz, K. (1968). Adaptive step size random search, Automatic Control, IEEE Transactions on 13, pp. 270-276.
25. Schwefel, H.-P. (1981). Numerical Optimization of Computer Models (John Wiley & Sons, Inc., New York, NY, USA).
26. Stewart, G. W. (1995). On sublinear convergence, Tech. Rep. CS-TR-3534, University of Maryland.
27. Teytaud, O. and Gelly, S. (2006). General lower bounds for evolutionary algorithms, in 10th International Conference on Parallel Problem Solving from Nature (PPSN 2006), Vol. 4193 (Springer), pp. 21-31.
28. Tikhomirov, A. S. (2006). On the markov homogeneous optimization method, Computational Mathematics and Mathematical, Physics 46, 3, pp. 361-375.
29. White, R. (1971). A survey of random methods for parameter optimization, SIM-ULATION 17, pp. 197-205.
30. Zhigljavsky, A. A. (1991). Theory of Global Random Search (Kluwer Academic Publishers).
31. Zhigljavsky, A. A. and Zilinskas, A. (2008). Stochastic global optimization, Springer Optimization and its applications, Vol. 1 (Springer).