Local and global oder 3/2 convergence of a surrogate evolutionary algorithm

Anne Auger 1 Marc Schoenauer 1 Olivier Teytaud 1
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : We prove a fast (better than superlinear) local convergence rate for an algorithm based on a quadratic approximation of the fitness function. An almost sure global convergence rate is proved for a corresponding memetic algorithm.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000540
Contributor : Olivier Teytaud <>
Submitted on : Monday, October 31, 2005 - 9:58:03 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Long-term archiving on : Friday, April 2, 2010 - 6:13:50 PM

Identifiers

  • HAL Id : inria-00000540, version 1

Collections

Citation

Anne Auger, Marc Schoenauer, Olivier Teytaud. Local and global oder 3/2 convergence of a surrogate evolutionary algorithm. GECCO - genetic and evolutionary computation conference, 2005, Washington, pp.857-864. ⟨inria-00000540⟩

Share

Metrics

Record views

333

Files downloads

758