On efficiency of a single variable bi-objective optimization algorithm

James M. Calvin, Antanas Žilinskas

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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
Volume14
Issue number1
DOIs
StatePublished - Feb 1 2020

All Science Journal Classification (ASJC) codes

  • Control and Optimization

Keywords

  • Bi-objective optimization
  • Efficiency
  • Global optimization

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

Cite this