Primal and Dual Approximation Algorithms for Convex Vector Optimization Problems
arXiv:1308.6809 · doi:10.1007/s10898-013-0136-0
Abstract
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson's outer approximation algorithm, and the second one is a dual variant of it. Both algorithms provide an inner as well as an outer approximation of the (upper and lower) images. Only one scalar convex program has to be solved in each iteration. We allow objective and constraint functions that are not necessarily differentiable, allow solid pointed polyhedral ordering cones, and relate the approximations to an appropriate ε-solution concept. Numerical examples are provided.
References in corpus (3)
Cited by in corpus (13)
- Set optimization - a rather short introduction
- Dual representations for systemic risk measures
- A Parametric Simplex Algorithm for Linear Vector Optimization Problems
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- A Monotonic Optimization Approach for Solving Strictly Quasiconvex Multiobjective Programming Problems
- Certainty Equivalent and Utility Indifference Pricing for Incomplete Preferences via Convex Vector Optimization
- Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations
- On the Approximation of Unbounded Convex Sets by Polyhedra
- Deep Learning the Efficient Frontier of Convex Vector Optimization Problems
- A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
- Polyhedral approximation of spectrahedral shadows via homogenization
- On the approximation error for approximating convex bodies using multiobjective optimization
- On Parallel and Batch-Cutting Strategies for Norm-Minimization-Based Convex Vector Optimization