Comparison-Based Complexity of Multiobjective Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Comparison-Based Complexity of Multiobjective Optimization


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
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : hal-00786635 , version 1


Olivier Teytaud. Comparison-Based Complexity of Multiobjective Optimization. GECCO 2011, 2011, Dublin, Ireland. pp.801-806. ⟨hal-00786635⟩
417 View
202 Download


Gmail Facebook Twitter LinkedIn More