Comparison-Based Complexity of Multiobjective Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Comparison-Based Complexity of Multiobjective Optimization

Résumé

Several comparison-based complexity results have been published recently, including multi-objective optimization. H owever, these results are, in the multiobjective case, quite pessimistic, due to the huge family of fitness function s considered. Combining assumptions on fitness functions and traditional comparison-based assumptions, we get more r ealistic bounds emphasizing the importance of reducing the number of conflicting objectives for reducing the runtime of multiobjective optimization. The approach can in particular predict lower bounds on the computation time, depend ing on the type of requested convergence: pointwise, or to the whole Pareto set. Also, a new (untested yet) algorith m is proposed for approximating the whole Pareto set.
Fichier principal
Vignette du fichier
moomosans.pdf (163.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00786635 , version 1 (09-02-2013)

Identifiants

  • HAL Id : hal-00786635 , version 1

Citer

Olivier Teytaud. Comparison-Based Complexity of Multiobjective Optimization. GECCO 2011, 2011, Dublin, Ireland. pp.801-806. ⟨hal-00786635⟩
418 Consultations
213 Téléchargements

Partager

Gmail Facebook X LinkedIn More