On efficiency of bicriteria optimization

Authors

James M. Calvin, Department of Computer Science
Antanas Žilinskas, Vilniaus Universitetas

Document Type

Conference Proceeding

Publication Date

2-12-2019

Abstract

We consider the problem of approximating the Pareto front for the optimization of two C ² 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.

Identifier

85061938165 (Scopus)

ISBN

[9780735417984]

Publication Title

Aip Conference Proceedings

External Full Text Location

https://doi.org/10.1063/1.5090002

e-ISSN

15517616

ISSN

0094243X

Volume

2070

Grant

1562466

Fund Ref

National Science Foundation

Recommended Citation

Calvin, James M. and Žilinskas, Antanas, "On efficiency of bicriteria optimization" (2019). Faculty Publications. 7788.
https://digitalcommons.njit.edu/fac_pubs/7788