Scalarization in vector optimization
From MaRDI portal
Publication:3328302
DOI10.1007/BF02592221zbMATH Open0539.90093OpenAlexW2057357578MaRDI QIDQ3328302FDOQ3328302
Authors: 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
Recommendations
- Scalarization of vector optimization problems
- scientific article; zbMATH DE number 4029283
- Publication:3491332
- Scalarization and stability in vector optimization
- scientific article; zbMATH DE number 558622
- Scalarization in geometric and functional vector optimization revisited
- On scalarization of vector optimization type problems
- On nonlinear scalarization in vector optimization
- scientific article; zbMATH DE number 19343
- scientific article; zbMATH DE number 3993319
Cites Work
- A Class of Solutions for Group Decision Problems
- Proper efficiency and the theory of vector maximization
- The method of successive approximations for functional equations
- Title not available (Why is that?)
- Proper Efficient Points for Maximizations with Respect to Cones
- Title not available (Why is that?)
- Maximal vectors and multi-objective optimization
- The geometry of Pareto efficiency over cones
- Compromise solutions and estimation of the noninferior set
- Compromise solutions, domination structures, and Salukvadze's solution
- Title not available (Why is that?)
- On convex vectorial optimization in linear spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization of vector functionals. I. The programming of optimal trajectories
- Title not available (Why is that?)
- On level sets and an approximation problem for the numerical solution of a free boundary problem
- Title not available (Why is that?)
- Note on the mean-square strategy for vector-valued objective functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the characterization of efficient points by means of monotone functionals
- The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
- Scalarization approaches for set-valued vector optimization problems and vector variational inequalities
- A conic scalarization method in multi-objective optimization
- Charnes-Cooper scalarization and convex vector optimization
- Characterizing the nondominated set by separable functions
- Duality for vector optimization problems via a general scalarization
- Nonconvex separation theorems and some applications in vector optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper robust mappings and vector minimization: An integral approach
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Partially ordered cooperative games: Extended core and Shapley value
- A survey of vector optimization in infinite-dimensional spaces. II
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- On scalarization of vector optimization type problems
- Cones admitting strictly positive functionals and scalarization of some vector optimization problems
- Bases of convex cones and Borwein's proper efficiency
- Existence of solutions for a generalized vector quasivariational inequality
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- A steepest descent-like method for variable order vector optimization problems
- A subgradient-like algorithm for solving vector convex inequalities
- On the choice of parameters for the weighting method in vector optimization
- A duality theory for set-valued functions. I: Fenchel conjugation theory
- Title not available (Why is that?)
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- A steepest descent-like method for vector optimization problems with variable domination structure
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- On efficient solutions with trade-offs bounded by given values
- The Pascoletti-Serafini scalarization scheme and linear vector optimization
- Title not available (Why is that?)
- Use of exact penalty functions to determine efficient decisions
- A generalized section theorem and a minimax inequality for a vector-valued mapping1
- Relationship between solid cones and cones with bases
- Scalarization of vector optimization problems
- A barrier-type method for multiobjective optimization
- Asymptotic analysis in convex composite multiobjective optimization problems
- Scalarization of Henig proper efficient points in a normed space
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- On some properties and an application of the logarithmic barrier method
- A unified vector optimization problem: complete scalarizations and applications
- Existence theorems in vector optimization
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
- A modified weighted Tchebycheff metric for multiple objective programming
- Solution concepts in continuous-kernel multicriteria games
- Stability achievement scalarization function for multiobjective nonlinear programming problems
- On the convergence of steepest descent methods for multiobjective optimization
- Convex composite multi-objective nonsmooth programming
- Title not available (Why is that?)
- Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
- Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems
- Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
- On the convergence of multiobjective evolutionary algorithms
- Continuous dependence of solutions on a parameter in a scalarization method
- Inexact projected gradient method for vector optimization
- On two-coefficient identification in elliptic variational inequalities
- Merit functions in vector optimization
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Super Efficiency in Vector Optimization
- Necessary conditions for extremality and separation theorems with applications to multiobjective optimization
- General communication schemes for multiobjective decision making
- Parametric approximation problems arising in vector optimization
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Two types of minimax theorems for vector-valued functions
- Super efficiency in convex vector optimization
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- Title not available (Why is that?)
- On the convergence of the projected gradient method for vector optimization
- Title not available (Why is that?)
- Notes on Lipschitz properties of nonlinear scalarization functions with applications
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Title not available (Why is that?)
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- On inexact projected gradient methods for solving variable vector optimization problems
- Nonconvex composite multiobjective nonsmooth fractional programming
- Title not available (Why is that?)
- Robustness to uncertain optimization using scalarization techniques and relations to multiobjective optimization
- A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
- A norm minimization-based convex vector optimization algorithm
- A general approach for studying duality in multiobjective optimization
- Time-varying multi-objective optimisation over switching graphs via fixed-time consensus algorithms
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- Images, fixed points and vector extremum problems
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Title not available (Why is that?)
- Explicit solution for a vector-valued LQG homing problem
- The hybrid approach: Lagrangian and proper equality constraints (Scalarization of vector optimization problems (SVOP))
- A unified scheme for scalarization in set optimization
- Regularized nonlinear scalarization for vector optimization problems with PDE-constraints
- Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini
- Title not available (Why is that?)
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone
- Title not available (Why is that?)
- Efficient solutions in generalized linear vector optimization
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Title not available (Why is that?)
- Scalarization in vector optimization with arbitrary domination sets
This page was built for publication: Scalarization in vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328302)
