Skip to Main content Skip to Navigation
Conference papers

Comparison-Based Complexity of Multiobjective Optimization

Olivier Teytaud 1, 2 
1 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Olivier Teytaud Connect in order to contact the contributor
Submitted on : Saturday, February 9, 2013 - 1:29:04 PM
Last modification on : Sunday, June 26, 2022 - 11:58:15 AM
Long-term archiving on: : Friday, May 10, 2013 - 4:02:04 AM


Files produced by the author(s)


  • HAL Id : hal-00786635, version 1



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



Record views


Files downloads