Scalarizing vector optimization problems
From MaRDI portal
Publication:1836592
DOI10.1007/BF00934564zbMath0505.90072OpenAlexW1988390667MaRDI QIDQ1836592
Paolo Serafini, Adriano Pascoletti
Publication date: 1984
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934564
convex conesreflexive Banach spacesscalarization of vector optimization problemssufficiency condition of optimality
Related Items (only showing first 100 items - show all)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Optimality conditions in optimization under uncertainty ⋮ Conjugate duality in set optimization via nonlinear scalarization ⋮ Ordinal optimization through multi-objective reformulation ⋮ Improved front steepest descent for multi-objective optimization ⋮ Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ Pareto front approximation through a multi-objective augmented Lagrangian method ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Solving multiobjective environmentally friendly and economically feasible electric power distribution problem by primal-dual interior-point method ⋮ Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods ⋮ An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ A memetic procedure for global multi-objective optimization ⋮ A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems ⋮ A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems ⋮ Efficient solutions in generalized linear vector optimization ⋮ Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors. ⋮ On quadratic scalarization of vector optimization problems in Banach spaces ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria ⋮ The modified objective-constraint scalarization approach for multiobjective optimization problems ⋮ Stability results for approximately efficient solutions ⋮ On a constructive approximation of the efficient outcomes in bicriterion vector optimization ⋮ On high-order model regularization for multiobjective optimization ⋮ Duality in disjunctive programming via vector optimization ⋮ Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization ⋮ Scalarization of vector optimization problems ⋮ A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini ⋮ An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization ⋮ A penalty decomposition approach for multi-objective cardinality-constrained optimization problems ⋮ Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems ⋮ What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization ⋮ Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming ⋮ Scalarizations for adaptively solving multi-objective optimization problems ⋮ Pareto analysis vis-à-vis balance space approach in multiobjective global optimization ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ Parametric disjunctive programming: One-sided differentiability of the value function ⋮ A deterministic algorithm for global multi-objective optimization ⋮ Selection of efficient points ⋮ Efficient algorithms for solving nonlinear fractional programming problems ⋮ Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone ⋮ A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems ⋮ Images, fixed points and vector extremum problems ⋮ Cones admitting strictly positive functionals and scalarization of some vector optimization problems ⋮ On the quality of discrete representations in multiple objective programming ⋮ Constrained optimization using multiple objective programming ⋮ Radiant separation theorems and minimum-type subdifferentials of calm functions ⋮ Norm-based approximation in \(E\)-\([0,1\) convex multi-objective programming] ⋮ A method for capturing the entire fuzzy non-dominated set of a fuzzy multi-criteria optimization problem ⋮ An exact algorithm for biobjective integer programming problems ⋮ Characterizing ϵ-properly efficient solutions ⋮ Split algorithms for multiobjective integer programming problems ⋮ Strong and weak conditions of regularity and optimality ⋮ A numerical method for constructing the Pareto front of multi-objective optimization problems ⋮ A new approach to approximate the bounded Pareto front ⋮ An iterative method for solving a bi-objective constrained portfolio optimization problem ⋮ Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems ⋮ Necessary conditions for nondominated solutions in vector optimization ⋮ Generating equidistant representations in biobjective programming ⋮ Norm-based approximation in multicriteria programming. ⋮ A limited memory quasi-Newton approach for multi-objective optimization ⋮ Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ An Image Set-Oriented Method for the Numerical Treatment of Bi-Level Multi-objective Optimization Problems ⋮ Scalarization in vector optimization with arbitrary domination sets ⋮ Retrieval and use of the balance set in multiobjective global optimization ⋮ A cutting-plane method to nonsmooth multiobjective optimization problems ⋮ A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ Numerical procedures in multiobjective optimization with variable ordering structures ⋮ The Pascoletti-Serafini scalarization scheme and linear vector optimization ⋮ Characterization of approximate solutions of vector optimization problems with a variable order structure ⋮ Notes on Lipschitz properties of nonlinear scalarization functions with applications ⋮ Equispaced Pareto front construction for constrained bi-objective optimization ⋮ Properly optimal elements in vector optimization with variable ordering structures ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ Concepts for approximate solutions of vector optimization problems with variable order structures ⋮ A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Multi-criteria optimization and decision-making in radiotherapy ⋮ Regularized nonlinear scalarization for vector optimization problems with PDE-constraints ⋮ Equilibrium in a vector supply–demand network with capacity constraints ⋮ On the choice of parameters for the weighting method in vector optimization ⋮ Generalized hyperplane methods for characterizing \(\Lambda\)-extreme points and trade-off rates for multiobjective optimization problems ⋮ A unified approach to uncertain optimization ⋮ Multiobjective bilevel optimization ⋮ Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior ⋮ Minimum type functions, plus-cogauges, and applications ⋮ Comparison of some scalarization methods in multiobjective optimization ⋮ Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem ⋮ Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization ⋮ Multiobjective optimization to a TB-HIV/AIDS coinfection optimal control problem
Cites Work
- On local Pareto Optima
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
- Multiple-objective optimization by a multiplier method of proper equality constraints--Part I: Theory
- Problems and methods with multiple objective functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Scalarizing vector optimization problems
