This paper is concerned with the definition of new derivative-free methods for box constrained multiobjective optimization. The method that we propose is a non-trivial extension of the well-known implicit filtering algorithm to the multiobjective case. Global convergence results are stated under smooth assumptions on the objective functions. We also show how the proposed method can be used as a tool to enhance the performance of the Direct MultiSearch (DMS) algorithm. Numerical results on a set of test problems show the efficiency of the implicit filtering algorithm when used to find a single Pareto solution of the problem. Furthermore, we also show through numerical experience that the proposed algorithm improves the performance of DMS alone when used to reconstruct the entire Pareto front.
2018, COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, Pages 267-296 (volume: 69)
An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints (01a Articolo in rivista)
Cocchi G., Liuzzi G., Papini A., Sciandrone M.
Gruppo di ricerca: Continuous Optimization