TL;DR
This paper introduces a derivative-free trust region method for multiobjective optimization that uses radial basis function surrogates, enabling efficient handling of expensive and high-dimensional problems with proven convergence.
Contribution
It develops a novel multiobjective trust region algorithm employing radial basis function surrogates, which scale linearly with problem dimension and are proven to converge to Pareto critical points.
Findings
Convergence to Pareto critical points is theoretically proven.
Radial basis function surrogates improve scalability for high-dimensional problems.
Numerical examples demonstrate the method's effectiveness.
Abstract
We present a flexible trust region descend algorithm for unconstrained and convexly constrained multiobjective optimization problems. It is targeted at heterogeneous and expensive problems, i.e., problems that have at least one objective function that is computationally expensive. The method is derivative-free in the sense that neither need derivative information be available for the expensive objectives nor are gradients approximated using repeated function evaluations as is the case in finite-difference methods. Instead, a multiobjective trust region approach is used that works similarly to its well-known scalar pendants. Local surrogate models constructed from evaluation data of the true objective functions are employed to compute possible descent directions. In contrast to existing multiobjective trust region algorithms, these surrogates are not polynomial but carefully constructed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
