Scalarization in vector optimization

DOI10.1007/BF02592221zbMath0539.90093OpenAlexW2057357578MaRDI QIDQ3328302

Johannes Jahn

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592221

zbMATH Keywords

approximationscalarizationnonconvex vector optimization

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (78)

General communication schemes for multiobjective decision making ⋮ A survey of vector optimization in infinite-dimensional spaces. II ⋮ On the completeness and constructiveness of parametric characterizations to vector optimization problems ⋮ Parametric approximation problems arising in vector optimization ⋮ Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions ⋮ Necessary conditions for extremality and separation theorems with applications to multiobjective optimization ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ A duality theory for set-valued functions. I: Fenchel conjugation theory ⋮ Scalarization of vector optimization problems ⋮ On inexact projected gradient methods for solving variable vector optimization problems ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ Characterizing the nondominated set by separable functions ⋮ A generalized section theorem and a minimax inequality for a vector-valued mapping¹ ⋮ Inexact projected gradient method for vector optimization ⋮ On two-coefficient identification in elliptic variational inequalities ⋮ Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini ⋮ A modified weighted Tchebycheff metric for multiple objective programming ⋮ OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION ⋮ A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application ⋮ Use of exact penalty functions to determine efficient decisions ⋮ A norm minimization-based convex vector optimization algorithm ⋮ A conic scalarization method in multi-objective optimization ⋮ Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone ⋮ Super Efficiency in Vector Optimization ⋮ Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions ⋮ Images, fixed points and vector extremum problems ⋮ Cones admitting strictly positive functionals and scalarization of some vector optimization problems ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints ⋮ Explicit solution for a vector-valued LQG homing problem ⋮ The Exactness Property of the Vector Exact l₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS ⋮ Two types of minimax theorems for vector-valued functions ⋮ The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems ⋮ Solution concepts in continuous-kernel multicriteria games ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ Efficient solutions in generalized linear vector optimization ⋮ Partially ordered cooperative games: Extended core and Shapley value ⋮ A steepest descent-like method for variable order vector optimization problems ⋮ A subgradient-like algorithm for solving vector convex inequalities ⋮ Notes on Lipschitz properties of nonlinear scalarization functions with applications ⋮ Robustness to uncertain optimization using scalarization techniques and relations to multiobjective optimization ⋮ On the characterization of efficient points by means of monotone functionals ⋮ A general approach for studying duality in multiobjective optimization ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ A barrier-type method for multiobjective optimization ⋮ On the choice of parameters for the weighting method in vector optimization ⋮ On some properties and an application of the logarithmic barrier method ⋮ Stability achievement scalarization function for multiobjective nonlinear programming problems ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Convex composite multi-objective nonsmooth programming ⋮ Nonconvex composite multiobjective nonsmooth fractional programming ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Nonconvex separation theorems and some applications in vector optimization ⋮ Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials ⋮ On Efficient Solutions with Trade-Offs Bounded by Given Values ⋮ A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems ⋮ On the convergence of multiobjective evolutionary algorithms ⋮ Merit functions in vector optimization ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems ⋮ Super efficiency in convex vector optimization ⋮ Upper robust mappings and vector minimization: An integral approach ⋮ Scalarization approaches for set-valued vector optimization problems and vector variational inequalities ⋮ Continuous dependence of solutions on a parameter in a scalarization method ⋮ Unnamed Item ⋮ A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals ⋮ Duality for vector optimization problems via a general scalarization ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ On the convergence of the projected gradient method for vector optimization ⋮ Existence of solutions for a generalized vector quasivariational inequality ⋮ Relationship between solid cones and cones with bases ⋮ Scalarization of Henig proper efficient points in a normed space ⋮ On the convergence of steepest descent methods for multiobjective optimization ⋮ Existence theorems in vector optimization ⋮ Time-varying multi-objective optimisation over switching graphs via fixed-time consensus algorithms ⋮ Bases of convex cones and Borwein's proper efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compromise solutions and estimation of the noninferior set
• On level sets and an approximation problem for the numerical solution of a free boundary problem
• Maximal vectors and multi-objective optimization
• On convex vectorial optimization in linear spaces
• Compromise solutions, domination structures, and Salukvadze's solution
• Proper efficiency and the theory of vector maximization
• Note on the mean-square strategy for vector-valued objective functions
• Optimization of vector functionals. I. The programming of optimal trajectories
• The method of successive approximations for functional equations
• The geometry of Pareto efficiency over cones
• Proper Efficient Points for Maximizations with Respect to Cones
• A Class of Solutions for Group Decision Problems

This page was built for publication: Scalarization in vector optimization