On efficiency of bicriteria optimization

James M. Calvin, Antanas Žilinskas

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We consider the problem of approximating the Pareto front for the optimization of two C 2 functions. An algorithm is described that is efficient in the sense that the number of function evaluations that are not on the Pareto front grows as the square of the logarithm of the number of function evaluations.

Original languageEnglish (US)
Title of host publicationProceedings LeGO 2018 � 14th International Global Optimization Workshop
EditorsAndre H. Deutz, Sander C. Hille, Yaroslav D. Sergeyev, Michael T. M. Emmerich
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735417984
StatePublished - Feb 12 2019
Event14th International Global Optimization Workshop, LeGO 2018 - Leiden, Netherlands
Duration: Sep 18 2018Sep 21 2018

Publication series

NameAIP Conference Proceedings
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616


Conference14th International Global Optimization Workshop, LeGO 2018

All Science Journal Classification (ASJC) codes

  • General Physics and Astronomy


Dive into the research topics of 'On efficiency of bicriteria optimization'. Together they form a unique fingerprint.

Cite this