Multiobjective optimization involving quadratic functions
Summary: Multiobjective optimization is nowadays a word of order in engineering projects. Although the idea involved is simple, the implementation of any procedure to solve a general problem is not an easy task. Evolutionary algorithms are widespread as a satisfactory technique to find a candidate set for the solution. Usually they supply a discrete picture of the Pareto front even if this front is continuous. In this paper we propose three methods for solving unconstrained multiobjective optimization problems involving quadratic functions. In the first, for biobjective optimization defined in the bidimensional space, a continuous Pareto set is found analytically. In the second, applicable to multiobjective optimization, a condition test is proposed to check if a point in the decision space is Pareto optimum or not and, in the third, with functions defined in \(n\)-dimensional space, a direct noniterative algorithm is proposed to find the Pareto set. Simple problems highlight the suitability of the proposed methods.
- Pareto‐based continuous evolutionary algorithms for multiobjective optimization
- A conjugate directions-type procedure for quadratic multiobjective optimization
- Multiobjective Optimization Through a Series of Single-Objective Formulations
- Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- Methods for aircraft guidance with changes in control priorities
- Convex combination of data matrices: PCA perturbation bounds for multi-objective optimal design of mechanical metafilters
- A multiplicative version of Promethee II applied to multiobjective optimization problems
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- On some multiobjective optimization problems arising in biology
- Quadratic scalarization for decomposed multiobjective optimization
- A conjugate directions-type procedure for quadratic multiobjective optimization
- Multi-objective optimization of engineering design problems through Pareto-based bat algorithm
- Regularities of Pareto sets in low-dimensional practical multi-criteria optimisation problems: analysis, explanation, and exploitation
- New mean and median techniques to solve multiobjective linear fractional programming problem and comparison with other techniques
- Decision space decomposition for multiobjective optimization
This page was built for publication: Multiobjective optimization involving quadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722862)