Primal and dual approximation algorithms for convex vector optimization problems
From MaRDI portal
Publication:475807
DOI10.1007/s10898-013-0136-0zbMath1334.90160arXiv1308.6809OpenAlexW2048944090WikidataQ57612119 ScholiaQ57612119MaRDI QIDQ475807
Firdevs Ulus, Birgit Rudloff, Andreas Löhne
Publication date: 27 November 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6809
algorithmsvector optimizationdualityconvex programmingouter approximationmultiple objective optimization
Related Items (27)
Time Consistency of the Mean-Risk Problem ⋮ Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ Convex projection and convex multi-objective optimization ⋮ An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ A norm minimization-based convex vector optimization algorithm ⋮ A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle ⋮ An algorithmic approach to multiobjective optimization with decision uncertainty ⋮ A Benson type algorithm for nonconvex multiobjective programming problems ⋮ An exact algorithm for biobjective integer programming problems ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Polyhedral approximation of spectrahedral shadows via homogenization ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ Primal and dual algorithms for optimization over the efficient set ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ Tractability of convex vector optimization problems in the sense of polyhedral approximations ⋮ Approximation of convex bodies by multiple objective optimization and an application in reachable sets ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ A Comparison of Techniques for Dynamic Multivariate Risk Measures ⋮ Set Optimization—A Rather Short Introduction ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ Inner approximation algorithm for solving linear multiobjective optimization problems
Uses Software
Cites Work
- Unnamed Item
- Set-valued average value at risk and its computation
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- An approximation algorithm for convex multi-objective programming problems
- Benson type algorithms for linear vector optimization and applications
- 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
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Primal-dual methods for vertex and facet enumeration
- Hedging and liquidation under transaction costs in currency markets
- Lagrange duality in set optimization
- Approximation methods in multiobjective programming
- Geometric Duality for Convex Vector Optimization Problems
- Graph Implementations for Nonsmooth Convex Programs
- Vector Optimization with Infimum and Supremum
- Solution concepts in vector optimization: a fresh look at an old story
- Geometric Duality in Multiple Objective Linear Programming
- AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS
- SET-VALUED SHORTFALL AND DIVERGENCE RISK MEASURES
- Convex Analysis
This page was built for publication: Primal and dual approximation algorithms for convex vector optimization problems
