Evolutionary continuation methods for optimization problems

Oliver Schuetze, Adriana Lara, Carlos A. Coello Coello

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

In this paper we develop evolutionary strategies for numerical continuation which we apply to scalar and multi-objective optimization problems. To be more precise, we will propose two different methods-an embedding algorithm and a multi-objectivization approach-which are designed to follow an implicitly defined curve where the aim can be to detect the endpoint of the curve (e.g., a root finding problem) or to approximate the entire curve (e.g., the Pareto set of a multi-objective optimization problem). We demonstrate that the novel approaches are very robust in finding the set of interest (point or curve) on several examples.

Original languageEnglish
Title of host publicationProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Pages651-658
Number of pages8
DOIs
StatePublished - 2009
Externally publishedYes
Event11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 - Montreal, QC, Canada
Duration: 8 Jul 200912 Jul 2009

Publication series

NameProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Conference

Conference11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Country/TerritoryCanada
CityMontreal, QC
Period8/07/0912/07/09

Keywords

  • Continuation method
  • Multi-objective optimization
  • Multi-objectivization
  • Root finding
  • Scalar optimization
  • evolutionary computation

Fingerprint

Dive into the research topics of 'Evolutionary continuation methods for optimization problems'. Together they form a unique fingerprint.

Cite this