Algorithms to Solve Unbounded Convex Vector Optimization Problems

DOI10.1137/22m1507693zbMath1522.90107arXiv2207.03200MaRDI QIDQ6076862

Gabriela Kováčová, Firdevs Ulus, Unnamed Author, Birgit Rudloff, Andrea Wagner

Publication date: 17 October 2023

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.03200

zbMATH Keywords

approximation algorithmconvex vector optimizationunbounded problemsapproximation of cones

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Primal and dual approximation algorithms for convex vector optimization problems
• A parametric simplex algorithm for linear vector optimization problems
• On duality in multiple objective linear programming
• An approximation algorithm for convex multi-objective programming problems
• Benson type algorithms for linear vector optimization and applications
• Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
• Theory of multiobjective optimization
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• The vector linear program solver Bensolve -- notes on theoretical background
• Tractability of convex vector optimization problems in the sense of polyhedral approximations
• Unbiased approximation in multicriteria optimization
• Scalarizing vector optimization problems
• Convex projection and convex multi-objective optimization
• A norm minimization-based convex vector optimization algorithm
• A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
• On the approximation of unbounded convex sets by polyhedra
• Geometric Duality for Convex Vector Optimization Problems
• Duality in Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• Adaptive Scalarization Methods in Multiobjective Optimization
• Time Consistency of the Mean-Risk Problem
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
• Solving Multiobjective Mixed Integer Convex Optimization Problems
• Outer approximation algorithms for convex vector optimization problems

This page was built for publication: Algorithms to Solve Unbounded Convex Vector Optimization Problems