@inproceedings{43d12e00435b4101b5033f0defca16d7,
title = "On efficiency of bicriteria optimization",
abstract = " 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.",
author = "Calvin, {James M.} and Antanas {\v Z}ilinskas",
note = "Publisher Copyright: {\textcopyright} 2019 Author(s).; 14th International Global Optimization Workshop, LeGO 2018 ; Conference date: 18-09-2018 Through 21-09-2018",
year = "2019",
month = feb,
day = "12",
doi = "10.1063/1.5090002",
language = "English (US)",
series = "AIP Conference Proceedings",
publisher = "American Institute of Physics Inc.",
editor = "Deutz, {Andre H.} and Hille, {Sander C.} and Sergeyev, {Yaroslav D.} and Emmerich, {Michael T. M.}",
booktitle = "Proceedings LeGO 2018 � 14th International Global Optimization Workshop",
}