Gap-free computation of Pareto-points by quadratic scalarizations
type: Item
instance of: scholarly article
title: Gap-free computation of Pareto-points by quadratic scalarizations
zbMATH Open document ID: 1131.90054
author: Jörg Fliege
published in: Mathematical Methods of Operations Research
publication date: 2004-09-22T00:00:00Z
review text: The paper deals with a multicriteria optimum design method where several objectives have to be minimized simultaneously. For these kind of problems, approximation of the whole solution set are of particular importance to decision makers. Usually, approximating this set involves solving a family of parametrized optimization problems. It was the aim of this paper to argue in favour of parameterised quadratic objective functions, in contrast to a standard weighting approach in which parametrised linear objective functions was used. These arguments were rest on the favourable numerical properties of these quadratic scalarizations, which were investigated in detail. Moreover, it was shown which parameter sets can be used to recover all solutions of an original multicriteria problem where the ordering in the image space was induced by an arbitrary convex cone. The paper is addressed to researches and engineers working in the area of Pareto optimization.
reviewed by: Stefan Jendo
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 2101618
zbMATH Keywords: multicriteria optimization
describes a project that uses: OLAF
describes a project that uses: NBI
describes a project that uses: filterSQP
MaRDI profile type: Publication
full work available at URL: s001860300316
OpenAlex ID: W2166028622
DOI: 10.1007/S001860300316
Recommended article: Computation of robust Pareto points
Recommended article: A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
Recommended article: A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
Recommended article: Quadratic scalarization for decomposed multiobjective optimization
Recommended article: Approximating Pareto curves using semidefinite relaxations
Recommended article: Q4424300
Recommended article: Q5291955
Recommended article: Regularization of the vector problem with quadratic criteria of Pareto optimization
Recommended article: Tracing Locally Pareto-Optimal Points by Numerical Integration
Recommended article: Approximation of a set of Pareto-optimal solutions
description: scientific article; zbMATH DE number 2101618