On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy

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

Volumn 4193 LNCS, Issue , 2006, Pages 32-41

  Teytaud, Olivier ^a   Gelly, Sylvain ^a   Mary, Jérémie ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL TECHNIQUES; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

ANTITHETIC ISOTROPY; ISOTROPIC ALGORITHMS; ISOTROPY; STRATIFIED ISOTROPY;

ALGORITHMS;

EID: 33750266276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_4     Document Type: Conference Paper

References (19)

1. A. Auger. Convergence results for (1,λ)-SA-ES using the theory of (φ-irreducible markov chains. Theoretical Computer Science, 2005. in press.
2. A. Auger, M. Jebalia, and O. Teytaud. Xse: quasi-random mutations for evolution strategies. In Proceedings of Evolutionary Algorithms, 12 pages, 2005.
3. H.-G. Beyer. The Theory of Evolutions Strategies. Springer, Heidelberg, 2001.
4. C. G. Broyden. The convergence of a class of double-rank minimization algorithms 2, the new algorithm, j. of the inst. for math, and applications, 6:222-231, 1970.
5. B. Chazelle. The discrepancy method: randomness and complexity. Cambridge University Press, New York, NY, USA, 2000.
6. J. H. Conway and N. J. Sloane. Sphere packings, lattices and groups. 1998.
7. R. Fletcher. A new approach to variable-metric algorithms, computer journal, 13:317-322, 1970.
8. G. Frahm and M. Junker. Generalized elliptical distributions: Models and estimation. Technical Report 0037, 2003.
9. D. Goldfarb. A family of variable-metric algorithms derived by variational means, mathematics of computation, 24:23-26, 1970.
10. U. Haagerup. The best constants in the khintchine inequality. Studia Math., 70:231-283, 1982.
11. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 11(1), 2003.
12. J. Jagerskupper. In between progress rate and stochastic convergence. Dagstuhl's seminar, 2006.
13. Literka. A remarkable monotonic property of the gamma function. Technical report, 2005.
14. R. Salomon. Resampling and its avoidance in genetic algorithms. In V. W. Porto, N. Saravanan, D. Waagen, and A. E. Eiben, editors, Evolutionary Programming VII, pages 335-344, Berlin, 1998. Springer.
15. R. Salomon. The deterministic genetic algorithm: Implementation details and some results, 1999.
16. D. F. Shanno. Conditioning of quasi-newton methods for function minimization, mathematics of computation, 24:647-656, 1970.
17. O. Teytaud and S. Gelly. General lower bounds for evolutionary algorithms, ppsn 2006.
18. Z. Wang, K. Droegemeier, L. White, and I. M. Navon. Application of a new adjoint newton algorithm to the 3-d arps storm scale model using simulated data. Monthly Weather Review, 125, No. 10, 2460-2478, 1997.
19. C. Witt and J. Jägersküpper. Rigorous runtime analysis of a (mu+1) es for the sphere function. In Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pages 849-856, 2005.