On efficiency of a single variable bi-objective optimization algorithm

James M. Calvin; Antanas Žilinskas

doi:10.1007/s11590-019-01471-4

On efficiency of a single variable bi-objective optimization algorithm

James M. Calvin, Antanas Žilinskas

Research output: Contribution to journal › Article › peer-review

4 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 language	American English
Pages (from-to)	259-267
Number of pages	9
Journal	Optimization Letters
Volume	14
Issue number	1
DOIs	https://doi.org/10.1007/s11590-019-01471-4
State	Published - Feb 1 2020
Externally published	Yes

ASJC Scopus subject areas

Control and Optimization
Business, Management and Accounting (miscellaneous)

Keywords

Bi-objective optimization
Efficiency
Global optimization

Access to Document

10.1007/s11590-019-01471-4

Cite this

@article{849a6185e5cc4eb88d50c893fb39c353,

title = "On efficiency of a single variable bi-objective optimization algorithm",

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.",

keywords = "Bi-objective optimization, Efficiency, Global optimization",

author = "Calvin, {James M.} and Antanas {\v Z}ilinskas",

note = "Publisher Copyright: {\textcopyright} 2019, Springer-Verlag GmbH Germany, part of Springer Nature.",

year = "2020",

month = feb,

day = "1",

doi = "10.1007/s11590-019-01471-4",

language = "American English",

volume = "14",

pages = "259--267",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - On efficiency of a single variable bi-objective optimization algorithm

AU - Calvin, James M.

AU - Žilinskas, Antanas

PY - 2020/2/1

Y1 - 2020/2/1

N2 - 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.

AB - 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.

KW - Bi-objective optimization

KW - Efficiency

KW - Global optimization

UR - http://www.scopus.com/inward/record.url?scp=85071665995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85071665995&partnerID=8YFLogxK

U2 - 10.1007/s11590-019-01471-4

DO - 10.1007/s11590-019-01471-4

M3 - Article

SN - 1862-4472

VL - 14

SP - 259

EP - 267

JO - Optimization Letters

JF - Optimization Letters

IS - 1

ER -

On efficiency of a single variable bi-objective optimization algorithm

Abstract

ASJC Scopus subject areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this