Theoretical analysis of evolutionary computation on continuously differentiable functions

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1401-1408

  Akimoto, Youhei ^a   Nagata, Yuichi ^a   Ono, Isao ^a   Kobayashi, Shigenobu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

CMAESs; Constrained minimization; Continuously differentiable functions; EDAs; Local convergence

Indexed keywords

CMAESS; CONSTRAINED MINIMIZATION; DIFFERENTIABLE FUNCTIONS; EDAS; LOCAL CONVERGENCE;

CALCULATIONS; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; STOCHASTIC SYSTEMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 77955916878     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830742     Document Type: Conference Paper

References (20)

1. A. Auger. Convergence results for the (1, λ)-SA-ES using the theory of φ-irreducible Markov chains. Theoretical Computer Science, 334(1-3): 35-69, 2005.
2. A. Bienvenue andO. François. Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. Theoretical Computer Science, 306(1-3): 269-289, 2003.
3. P. Billingsley. Probability and Measure. WILEY SERIES IN PROBABILITY AND MATHEMATICAL STATISTICS. Wiley-Interscience, third edition, 1995.
4. H. A. David andH. N. Nagaraja. Order Statistics. WILEY SERIES IN PROBABILITY AND STATISTICS. Wiley-Interscience, third edition, 2003.
5. J. Grahl, P. A. N. Bosnian, andF. Rothlauf. The correlation-triggered adaptive variance scaling idea. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2006, pages 397-404, 2006. ACM.
6. N. Hansen. The CMA evolution strategy: a comparing review. In Towards a new evolutionary computation. Advances on estimation of distribution algorithms, pages 75-102. Springer, 2006.
7. N. Hansen, S. Müller, andP. Koumoutsakos. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary Computation, 11(1): 1-18, 2003.
8. N. Hansen andA. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2): 159-195, 2001.
9. J. Jägersküpper. Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science, 379(3): 329-347, 2007.
10. K. C. Kiwiel andK. Murty. Convergence of the steepest descent method for minimizing quasiconvex functions. Journal of Optimization Theory and Applications, 89(1): 221-226, 1996.
11. P. Larrañaga andJ. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
12. D.-H. Li andM. Fukushima. On the global convergence of the bfgs method for nonconvex unconstrained optimization problems. SIAM Journal on Optimization, 11 (4): 1054-1064, 2001.
13. M. Locatelli. Simulated annealing algorithms for continuous global optimization: Convergence conditions. Journal of Optimization Theory and Applications, 104(1): 121-133, 1 2000.
14. J. Nocedal andS. J. Wright. Numerical Optimization. Springer Series in Operations Research. Springer, second edition, 2006.
15. A. Ruszczyński. Nonlinear Optimization. Princeton University Press, 2006.
16. M. A. Semenov andD. A. Terkel. Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic lyapunov function. Evolutionary Computation, 11(4): 363-379, 2003.
17. O. Teytaud andH. Fournier. Lower bounds for evolution strategies using vc-dimension. In Parallel Problem Solving from Nature - PPSN X, volume 5199 of Lecture Notes in Computer Science, pages 102-111, 2008. Springer-Verlag.
18. A. W. van der Vaart. Asymptotic Statistics. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2000.
19. C. Witt. Why standard particle swarm optimisers elude a theoretical runtime analysis. In FOGA '09: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pages 13-20, 2009. ACM.
20. R. L. Yang. Convergence of the simulated annealing algorithm for continuous global optimization. Journal of Optimization Theory and Applications, 104(3): 691-716, 2000.