On efficiency of a single variable bi-objective optimization algorithm
2019
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:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
13
References
5
Citations
NaN
KQI