Abstract In this paper we consider a problem, called convex projection, of projecting set onto subspace. We will show that to projection one can assign particular multi-objective optimization such the solution problem also solves (and vice versa), which is analogous result in polyhedral case considered Löhne and Weißing (Math Methods Oper Res 84(2):411–426, 2016). practice, however, only comput...

Most of the derivative-free optimization (DFO) algorithms rely on a comparison function able to compare any pair of points with respect to a blackbox objective function. Recently, new dedicated derivative-free optimization algorithms have emerged to tackle multi-objective optimization problems and provide a Pareto front approximation to the user. This work aims at reusing single objective DFO a...