2 papers
math.OC2019
Solving polyhedral d.c. optimization problems via concave minimization
Simeon vom Dahl, Andreas Löhne
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We cha…
math.OC2017
A set optimization approach to zero-sum matrix games with multi-dimensional payoffs
Andreas H. Hamel, Andreas Loehne
A new solution concept for two-player zero-sum matrix games with multi-dimensional payoff is introduced. It is based on extensions of vector orders in K-dimensional spaces to order…