Convergence proofs, convergence rates and stopping criterions for multi-modal or multi-objective evolutionary algorithms

Yann Bonnemay; Michèle Sebag; Olivier Teytaud

Conference Papers Year : 2005

Convergence proofs, convergence rates and stopping criterions for multi-modal or multi-objective evolutionary algorithms

(1) , (1) , (1)

Yann Bonnemay

Function : Author

Algorithmic number theory for cryptology

Michèle Sebag

Function : Author
PersonId : 836537

Algorithmic number theory for cryptology

Olivier Teytaud

Function : Author
PersonId : 581
IdHAL : olivier-teytaud
IdRef : 05971008X

Algorithmic number theory for cryptology

Abstract

We provide - convergence proofs - convergence rates - a stopping criterion for multi-objective or multi-modal evolutionary algorithms.

Domains

Optimization and Control [math.OC]

Fichier principal

pareto.pdf (146.84 Ko)

Olivier Teytaud : Connect in order to contact the contributor

https://inria.hal.science/inria-00000545

Submitted on : Tuesday, November 1, 2005-2:53:22 PM

Last modification on : Wednesday, April 17, 2024-12:01:12 PM

Long-term archiving on: Friday, April 2, 2010-6:16:03 PM

Dates and versions

inria-00000545 , version 1 (01-11-2005)

Identifiers

HAL Id : inria-00000545 , version 1

Cite

Yann Bonnemay, Michèle Sebag, Olivier Teytaud. Convergence proofs, convergence rates and stopping criterions for multi-modal or multi-objective evolutionary algorithms. Evolution artificielle, 2005, Lille, France. 12 p. ⟨inria-00000545⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS INRIA LIX X-LIX X-DEP-INFO PARISTECH INRIA2 TDS-MACS

126 View

148 Download

Convergence proofs, convergence rates and stopping criterions for multi-modal or multi-objective evolutionary algorithms

Abstract

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share