Universal procedure for constructing a Pareto set
From MaRDI portal
multiobjective optimizationnonnegative orthantfinite dimensionalGermeier convolutionuniversal procedure(weak) effective solutions\(\omega\) concavityparametric construction of Pareto set
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Convexity of real functions of several variables, generalizations (26B25) Multiobjective variational problems, Pareto optimality, applications to economics, etc. (58E17)
Recommendations
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- Methods of approximating Pareto set faces in a linear multiple-criteria problem
- Uniform convergence and Pareto optimality
- scientific article; zbMATH DE number 3910156
- scientific article; zbMATH DE number 7434530
Cites work
- scientific article; zbMATH DE number 3850843 (Why is no real title available?)
- scientific article; zbMATH DE number 3972626 (Why is no real title available?)
- Approximate reduction of the problem of determining a maximin to the problem of determining a maximum by means of penalty functions
- Constructing a set of effective vectors by \(\varepsilon\)-perturbations method
Cited in
(6)- The fixed point property in convex multi-objective optimization problem
- Construction of Pareto set in a system of conceptual uncertainty problems
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- scientific article; zbMATH DE number 4012302 (Why is no real title available?)
- scientific article; zbMATH DE number 7434530 (Why is no real title available?)
- Synthesis of numerical methods for Pareto set approximation based on a universal procedure
This page was built for publication: Universal procedure for constructing a Pareto set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357117)
