Convex projection and convex multi-objective optimization
From MaRDI portal
Publication:2141728
DOI10.1007/s10898-021-01111-1zbMath1489.90176arXiv2103.04076OpenAlexW3215362574MaRDI QIDQ2141728
Gabriela Kováčová, Birgit Rudloff
Publication date: 25 May 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.04076
Convex programming (90C25) Multi-objective and goal programming (90C29) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (1)
Uses Software
Cites Work
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Primal and dual approximation algorithms for convex vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- The vector linear program solver Bensolve -- notes on theoretical background
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Vector Optimization with Infimum and Supremum
- Time Consistency of the Mean-Risk Problem
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Dynamic Set Values for Nonzero-Sum Games with Multiple Equilibriums
- Convex Analysis
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
This page was built for publication: Convex projection and convex multi-objective optimization