A norm minimization-based convex vector optimization algorithm
From MaRDI portal
Publication:2156397
Abstract: We propose an algorithm to generate inner and outer polyhedral approximations to the upper image of a bounded convex vector optimization problem. It is an outer approximation algorithm and is based on solving norm-minimizing scalarizations. Unlike Pascolleti-Serafini scalarization used in the literature for similar purposes, it does not involve a direction parameter. Therefore, the algorithm is free of direction-biasedness. We also propose a modification of the algorithm by introducing a suitable compact subset of the upper image, which helps in proving for the first time the finiteness of an algorithm for convex vector optimization. The computational performance of the algorithms is illustrated using some of the benchmark test problems, which shows promising results in comparison to a similar algorithm that is based on Pascoletti-Serafini scalarization.
Recommendations
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Primal and dual approximation algorithms for convex vector optimization problems
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- Publication:3484643
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 757675 (Why is no real title available?)
- A Benson type algorithm for nonconvex multiobjective programming problems
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A new scalarization technique and new algorithms to generate Pareto fronts
- A parametric simplex algorithm for linear vector optimization problems
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- A revised simplex method for linear multiple objective programs
- Adaptive Scalarization Methods in Multiobjective Optimization
- An approximation algorithm for convex multi-objective programming problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximation methods in multiobjective programming
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- Comparison of some scalarization methods in multiobjective optimization
- Convex Analysis
- Distance Between Sets - A survey
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- Graph implementations for nonsmooth convex programs
- Infinite dimensional analysis. A hitchhiker's guide.
- Merit functions in vector optimization
- Multicriteria Optimization
- Multiple criteria decision analysis. State of the art surveys
- On min-norm and min-max methods of multi-objective optimization
- Polyhedral cones and positive operators
- Primal and dual approximation algorithms for convex vector optimization problems
- Scalarization in vector optimization
- Scalarizing vector optimization problems
- Set-valued optimization. An introduction with applications
- Solution concepts in vector optimization: a fresh look at an old story
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- Solving multiobjective mixed integer convex optimization problems
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Trade-off analysis approach for interactive nonlinear multiobjective optimization
- Vector Optimization
- Vector Optimization with Infimum and Supremum
Cited in
(9)- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Outer approximation algorithms for convex vector optimization problems
- Computing the recession cone of a convex upper image via convex projection
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Primal and dual approximation algorithms for convex vector optimization problems
This page was built for publication: A norm minimization-based convex vector optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156397)
