On efficiency of a single variable bi-objective optimization algorithm

Document Type

Article

Publication Date

2-1-2020

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.

Identifier

85071665995 (Scopus)

Publication Title

Optimization Letters

External Full Text Location

https://doi.org/10.1007/s11590-019-01471-4

e-ISSN

18624480

ISSN

18624472

First Page

259

Last Page

267

Issue

1

Volume

14

Grant

CMMI-1562466

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS