Primal and dual approximation algorithms for convex vector optimization problems
From MaRDI portal
(Redirected from Publication:475807)
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 epsilon-solution concept. Numerical examples are provided.
Recommendations
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A norm minimization-based convex vector optimization algorithm
- Geometric duality for convex vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
Cites work
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- An algorithm for calculating the set of superhedging portfolios in markets with transaction costs
- 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
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Approximation methods in multiobjective programming
- Benson type algorithms for linear vector optimization and applications
- Convex Analysis
- Geometric Duality in Multiple Objective Linear Programming
- Geometric duality for convex vector optimization problems
- Graph implementations for nonsmooth convex programs
- Hedging and liquidation under transaction costs in currency markets
- Lagrange duality in set optimization
- Primal-dual methods for vertex and facet enumeration
- Set-valued average value at risk and its computation
- Set-valued shortfall and divergence risk measures
- Solution concepts in vector optimization: a fresh look at an old story
- Vector Optimization with Infimum and Supremum
Cited in
(38)- A comparison of techniques for dynamic multivariate risk measures
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
- Polyhedral approximation of spectrahedral shadows via homogenization
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Outer approximation algorithms for convex vector optimization problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- The primal-dual method for approximation algorithms
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Computing the recession cone of a convex upper image via convex projection
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- PaMILO: a solver for multi-objective mixed integer linear optimization and beyond
- Convex projection and convex multi-objective optimization
- A Benson type algorithm for nonconvex multiobjective programming problems
- Inner approximation algorithm for solving linear multiobjective optimization problems
- On the approximation of unbounded convex sets by polyhedra
- Nonconvex constrained optimization by a filtering branch and bound
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- An approximation algorithm for multiobjective mixed-integer convex optimization
- Deep learning the efficient frontier of convex vector optimization problems
- A norm minimization-based convex vector optimization algorithm
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- Time consistency of the mean-risk problem
- scientific article; zbMATH DE number 3905309 (Why is no real title available?)
- A solver for multiobjective mixed-integer convex and nonconvex optimization
- Solving generalized convex multiobjective programming problems by a normal direction method
- Primal and dual algorithms for optimization over the efficient set
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- An algorithmic approach to multiobjective optimization with decision uncertainty
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Solving multiobjective mixed integer convex optimization problems
- Set Optimization—A Rather Short Introduction
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- An exact algorithm for biobjective integer programming problems
- A parametric simplex algorithm for linear vector optimization problems
This page was built for publication: Primal and dual 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 Q475807)
