Publications

Optimization problems with multiple objectives which are expensive, i.e., where function evaluations are time consuming, are difficult to solve. Finding at least one locally optimal solution is already a difficult task. In case only one of the objective functions is expensive while the others are cheap, for instance, analytically given, this can be used in the optimization procedure. Using a trust-region approach and the Tammer-Weidner-functional for finding descent directions, in [19] an algorithm was proposed which makes use of the heterogeneity of the objective functions. In this paper, we present three heuristic approaches, which allow to find additional optimal solutions of the multiobjective optimization problem and by that representations at least of parts of the Pareto front. We present the related theoretical results as well as numerical results on some test instances.