Aiming for a theoretically tractable CSA variant by means of empirical investigations

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 503-510

  Jägersküpper, Jens ^a   Preuss, Mike ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Empirical analysis; Evolution strategies; Sphere function

Indexed keywords

GAUSSIAN NOISE (ELECTRONIC); NORMAL DISTRIBUTION;

BLACK-BOX OPTIMIZATION; EMPIRICAL ANALYSIS; EMPIRICAL INVESTIGATION; EVOLUTION STRATEGIES; PERFORMANCE TUNING; SPHERE FUNCTIONS; STEP-SIZE ADAPTATIONS; STEP-SIZE CONTROLS;

OPTIMIZATION;

EID: 57349116208     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389191     Document Type: Conference Paper

References (12)

1. Beyer, H.-G. (2001): The Theory of Evolution Strategies. Springer.
2. Beyer, H.-G., Arnold, D. V. (2003a): A comparison of evolution strategies with other direct search methods in the presence of noise. Computational Optimization and Applications, 24(1):135-159.
3. Beyer, H.-G., Arnold, D. V. (2003b): Qualms regarding the optimality of cumulative path length control in CSA/CMA-Evolution Strategies. Evolutionary Computation, 11(1):19-28.
4. Droste, S., Jansen, T., Wegener, I. (2002): On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276(1-2):51-82.
5. Hansen, N. (2008): List of references to various applications of CMA-ES. http://www.bionik.tu-berlin.de/ user/niko/cmaapplications.pdf.
6. Hansen, N., Ostermeier, A. (1996): Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Proc. IEEE Int'l Conference on Evolutionary Computation (ICEC), 312-317.
7. Jägersküpper, J. (2003): Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces. In Proc. 30th Int'l Colloquium on Automata, Languages and Programming (ICALP), vol. 2719 of LNCS, 1068-79, Springer.
8. Jägersküpper, J. (2005): How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. Theoretical Computer Science, 361(1):38-56.
9. Jägersküpper, J. (2007): Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science, 379 (3): 329-347.
10. Kolda, T. G., Lewis, R. M., Torczon, V. (2004): Optimization by direct search: New perspectives on some classical and modern methods. SIAM Review, 45(3):385-482.
11. Nocedal, J., Wright, S. J. (1999): Numerical Optimization. Springer.
12. Schwefel, H.-P. (1981): Numerical Optimization of Computer Models. Wiley, New York.