Evolutionary gradient search revisited

IEEE Transactions on Evolutionary Computation

Volumn 11, Issue 4, 2007, Pages 480-495

  Arnold, Dirk V ^a   Salomon, Ralf ^b  

^a DALHOUSIE UNIVERSITY   (Canada)

^b UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Covariance matrix adaptation (CMA); Evolution strategies; Evolutionary gradient search (EGS); Noise; Quality gain analysis

Indexed keywords

COVARIANCE MATRIX; GRADIENT METHODS; MATHEMATICAL MODELS; OPTIMIZATION;

COVARIANCE MATRIX ADAPTATION (CMA); EVOLUTIONARY GRADIENT SEARCH (EGS); EVOLUTIONARY STRATEGIES; QUALITY GAIN ANALYSIS;

EVOLUTIONARY ALGORITHMS;

EID: 34547907407     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2006.882427     Document Type: Article

References (32)

1. I. Rechenberg, Evolutionsstrategie'94. Stuttgart, Germany: Frommann-Holzboog Verlag, 1994.
2. H.-P. Schwefel, Evolution and Optimum Seeking. New York: Wiley, 1995.
3. H.-G. Beyer, The Theory of Evolution Strategies. Heidelberg, Germany: Springer-Verlag, 2001.
4. H.-G. Beyer and H.-P. Schwefel, "Evolution strategies - Acomprehensive introduction," Natural Comput., vol. 1, no. 1, pp. 3-52, 2002.
5. J. Nocedal and S. J. Wright, Numerical Optimization. Heidelberg, Germany: Springer-Verlag, 2000.
6. R. Salomon, "Evolutionary algorithms and gradient search: Similarities and differences," IEEE Trans. Evol. Comput., vol. 2, no. 2, pp. 45-55, Jul. 1998.
7. N. Hansen and A. Ostermeier, "Completely derandomized self-adaptation in evolution strategies," Evol. Comput., vol. 9, no. 2, pp. 159-195, 2001.
8. C. T. Kelley, Iterative Methods for Optimization. Philadelphia, PA: SIAM, 1999.
9. H.-G. Beyer, "On the "explorative power" of ES/EP-like algorithms," in Evolutionary Programming VII, A. E. Eiben, Ed. Heidelberg, Germany: Springer-Verlag, 1998, pp. 323-334.
10. D. V. Arnold, "An analysis of evolutionary gradient search," in Proc. IEEE Congr. Evol. Comput., 2004, pp. 47-54.
11. H.-G. Beyer, "Toward a theory of evolution strategies: On the benefit of sex - The (μ/μ λ)-theory," Evol. Comput., vol. 3, no. 1, pp. 81-111, 1995.
12. D. V. Arnold and H.-G. Beyer, "Local performance of the (μ/μ, λ)-ES in a noisy environment," in Foundations of Genetic Algorithms 6, W.N. Martin and W. M. Spears, Eds. San Mateo, CA: Morgan Kaufmann, 2001, pp. 127-141.
13. R. Salomon, "Inverse mutations: Making the evolutionary-gradient-search procedure noise robust," in Proceedings of Artificial Intelligence and Applications - AIA 2005, M. H. Hamza, Ed. Calgary, AB, Canada: Acta Press, 2005.
14. H.-G. Beyer, "Mutate 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, A. E. Eiben, Ed. Heidelberg, Germany: Springer-Verlag, 1998, pp. 109-118.
15. H.-G. Beyer, "Evolutionary algorithms in noisy environments: Theoretical issues and guidelines for practice," Comput. Methods Mech. Appl. Eng., vol. 186, pp. 239-267, 2000.
16. D. V. Arnold and H.-G. Beyer, "A comparison of evolution strategies with other direct search methods in the presence of noise," Comput. Opt. Appl., vol. 24, no. 1, pp. 135-159, 2003.
17. I. Rechenberg, Evolutionsstrategie - Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart, Germany: Friedrich Frommann Verlag, 1973.
18. H.-P. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie. Basel, Germany: Birkhäuser Verlag, 1977.
19. A. Ostermeier, A. Gawelczyk, and N. Hansen, "Step-size adaptation based on non-local use of selection information," in Parallel Problem Solving from Nature - PPSN III, Y. Davidor, Ed. Heidelberg, Germany: Springer-Verlag, 1994, pp. 189-198.
20. D. V. Arnold, Noisy Optimization with Evolution Strategies. Norwell, MA: Kluwer, 2002.
21. D. V. Arnold and H.-G. Beyer, "Performance analysis of evolutionary optimization with cumulative step length adaptation," IEEE Trans. Autom. Control, vol. 49, no. 4, pp. 617-622, Apr. 2004.
22. L. D. Whitley, M. Lunacek, and J. Knight, "Ruffled by ridges: How evolutionary algorithms can fail," in Proc. Genetic and Evol. Comput. Conf., K. Deb, Ed., 2004, pp. 294-306.
23. R. Salomon, "Accelerating the evolutionary-gradient-search procedure: Individual step sizes," in Parallel Problem Solving from Nature - PPSN V, T. Bäck, Ed. Heidelberg, Germany: Springer-Verlag, 1998, pp. 408-417.
24. J. Poland and A. Zell, "Main vector adaptation: A CMA variant with linear time and space complexity," in Proc. Genetic Evol. Comput. Conf., L. Spector, Ed., 2001, pp. 1050-1055.
25. A. Auger and N. Hansen, "Reconsidering the progress rate theory for evolution strategies in finite dimensions," in Proc. Genetic Evol. Comput. Conf., M. Keijzer, Ed., 2006, pp. 445-452.
26. N -search spaces disturbed by noise," Theoretical Comput. Sci., vol. 289, no. 1, pp. 629-647, 2002.
27. G. Rudolph, "On correlated mutations in evolution strategies," in Parallel Problem Solving from Nature - PPSN II, R. Männer and B. Manderick, Eds. Amsterdam, The Netherlands: Elsevier, 1992, pp. 105-114.
28. N. Hansen and S. Kern, "Evaluating the CMA evolution strategy on multimodal test functions," in Parallel Problem Solving from Nature - PPSN VIII, X. Yao, Ed. Heidelberg, Germany: Springer-Verlag, 2004, pp. 282-291.
29. N. Hansen, S. D. Müller, and P. Koumoutsakos, "Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)," Evol. Comput., vol. 11, no. 1, pp. 1-18, 2003.
30. G. Rudolph, Convergence Properties of Evolutionary Algorithms. Hamburg, Germany: Verlag Dr. Kovač, 1997.
31. D. V. Arnold, "Optimal weighted recombination," in Foundations of Genetic Algorithms 8, A. H. Wright, Ed. Heidelberg, Germany: Springer-Verlag, 2005, pp. 215-237.
32. D. V. Arnold, "Evolution strategies with adaptively rescaled mutation vectors," in Proc. IEEE Congr. Evol. Comput., 2005, pp. 2592-2599.