2 citations · 8 across the 13 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021★ 1 cited
On unbounded polyhedral convex set optimization problems
Niklas Hey, Andreas Löhne
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the -dimensional to the -dimensional Euclidean space whose graph is a convex poly…
math.OC2021★ 1 cited
On the approximation error for approximating convex bodies using multiobjective optimization
Andreas Löhne, Fangyuan Zhao, Lizhen Shao
A polyhedral approximation of a convex body can be calculated by solving approximately an associated multiobjective convex program (MOCP). An MOCP can be solved approximately by Be…