On efficiency of a single variable bi-objective optimization algorithm

James M. Calvin, Antanas Žilinskas

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


We consider the problem of approximating the Pareto front in the bi-objective optimization problem with twice continuously-differentiable functions. An algorithm is described that is efficient in the sense that the number of function evaluations that are not on the true Pareto front grows as the square of the logarithm of the number of function evaluations.

Original languageEnglish (US)
Pages (from-to)259-267
Number of pages9
JournalOptimization Letters
Issue number1
StatePublished - Feb 1 2020
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Business, Management and Accounting (miscellaneous)


  • Bi-objective optimization
  • Efficiency
  • Global optimization


Dive into the research topics of 'On efficiency of a single variable bi-objective optimization algorithm'. Together they form a unique fingerprint.

Cite this