Outer approximation algorithms for convex vector optimization problems
From MaRDI portal
Abstract: In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is solved iteratively. This scalarization finds the minimum 'distance' from a reference point, which is usually taken as a vertex of the current outer approximation, to the upper image through a given direction. We propose efficient methods to select the parameters (the reference point and direction vector) of the PS scalarization and analyze the effects of these on the overall performance of the algorithm. Different from the existing vertex selection rules from the literature, the proposed methods do not require solving additional single-objective optimization problems. Using some test problems, we conduct an extensive computational study where three different measures are set as the stopping criteria: the approximation error, the runtime, and the cardinality of solution set. We observe that the proposed variants have satisfactory results especially in terms of runtime compared to the existing variants from the literature.
Cites work
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A norm minimization-based convex vector optimization algorithm
- 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
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Primal and dual approximation algorithms for convex vector optimization problems
- Scalarizing vector optimization problems
- Set-valued average value at risk and its computation
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Unbiased approximation in multicriteria optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Vector Optimization with Infimum and Supremum
Cited in
(6)- Convergent outer approximation algorithms for solving unary programs
- scientific article; zbMATH DE number 1530351 (Why is no real title available?)
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Deep learning the efficient frontier of convex vector optimization problems
- On parallel and batch-cutting strategies for norm-minimization-based convex vector optimization
This page was built for publication: Outer approximation algorithms for convex vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113528)
