Abstract. We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531–544). The method highlights and exploits the underlying manifold structure of the Pareto sets, approximating Pareto optima by means of simplicial complexes. The method distinguishes the hierarchy between singular set, Pareto critical set and stable Pareto critical set, and can handle the problem of super-position of local Pareto fronts, occurring in the general nonconvex case. Furthermore, a quadratic convergence result in a suitable set–wise sense is proven and tested in a number of numerical exam-ples. Key words. Multiobjective optimization, Pareto critical set, Delaunay...
The paper concerns multiobjective linear optimization problems in Rn that are parameterized with res...
AbstractA descent method on a closed set X of a Hilbert space, adapted to the multi-objective optimi...
International audienceThe solution to a biobjective optimization problem is composed of a collection...
We propose a strategy for approximating Pareto optimal sets based on the global analysis framework p...
Abstract In this paper we consider the problem of generating a well sampled discrete representation ...
In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic ...
An approach to constructing a Pareto front approximation to computationally expensive multiobjective...
Extending the notion of global search to multiobjective optimization is far than straightforward, ma...
This paper contains new developments on necessary conditions for minimal points of sets and their ap...
International audienceIn this paper we introduce a definition of approximate Pareto efficient soluti...
ABSTRACT. In smooth and convex multiobjective optimization problems the set of Pareto optima is diff...
Abstract Extending the notion of global search to multiobjective optimization is far than straightfo...
In this paper we derive new sufficient conditions for global weak Pareto solutions to set-valued opt...
In many engineering problems, we face multi-objective optimization, with several objective functions...
We consider the problem of constructing an approximation of the Pareto curve associated with the mul...
The paper concerns multiobjective linear optimization problems in Rn that are parameterized with res...
AbstractA descent method on a closed set X of a Hilbert space, adapted to the multi-objective optimi...
International audienceThe solution to a biobjective optimization problem is composed of a collection...
We propose a strategy for approximating Pareto optimal sets based on the global analysis framework p...
Abstract In this paper we consider the problem of generating a well sampled discrete representation ...
In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic ...
An approach to constructing a Pareto front approximation to computationally expensive multiobjective...
Extending the notion of global search to multiobjective optimization is far than straightforward, ma...
This paper contains new developments on necessary conditions for minimal points of sets and their ap...
International audienceIn this paper we introduce a definition of approximate Pareto efficient soluti...
ABSTRACT. In smooth and convex multiobjective optimization problems the set of Pareto optima is diff...
Abstract Extending the notion of global search to multiobjective optimization is far than straightfo...
In this paper we derive new sufficient conditions for global weak Pareto solutions to set-valued opt...
In many engineering problems, we face multi-objective optimization, with several objective functions...
We consider the problem of constructing an approximation of the Pareto curve associated with the mul...
The paper concerns multiobjective linear optimization problems in Rn that are parameterized with res...
AbstractA descent method on a closed set X of a Hilbert space, adapted to the multi-objective optimi...
International audienceThe solution to a biobjective optimization problem is composed of a collection...