Back to Search
Start Over
Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties
- Source :
- Theoretical Computer Science, Theoretical Computer Science, Elsevier, 2003, 306 (1-3), pp.269-289. ⟨10.1016/S0304-3975(03)00284-6⟩
- Publisher :
- Elsevier B.V.
-
Abstract
- International audience; This paper presents simple proofs for the global convergence of evolution strategies in spherical problems. We investigate convergence properties for both adaptive and self-adaptive strategies. Regarding adaptive strategies, the convergence rates are computed explicitly and compared with the results obtained in the so-called “rate-of-progress” theory. Regarding self-adaptive strategies, the computation is conditional to the knowledge of a specific induced Markov chain. An explicit example of chaotic behavior illustrates the complexity in dealing with such chains. In addition to these proofs, this work outlines a number of difficulties in dealing with evolution strategies.
- Subjects :
- Mathematical optimization
Adaptive strategies
[SHS.STAT]Humanities and Social Sciences/Methods and statistics
General Computer Science
Markov chain
Markov chains
Computation
Chaotic
0102 computer and information sciences
02 engineering and technology
Mathematical proof
Global convergence
01 natural sciences
Theoretical Computer Science
Evolution strategies
010201 computation theory & mathematics
Simple (abstract algebra)
Convergence (routing)
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Mathematics
Computer Science(all)
Subjects
Details
- Language :
- English
- ISSN :
- 03043975 and 18792294
- Issue :
- 1-3
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi.dedup.....c95ba1a233e6f6a483cafccf70940dfb
- Full Text :
- https://doi.org/10.1016/S0304-3975(03)00284-6