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.
All Science Journal Classification (ASJC) codes
- Control and Optimization
- Bi-objective optimization
- Global optimization