This paper is concerned with solution algorithms for general convex vector optimization
problems (CVOPs). So far, solution concepts and approximation algorithms for solving …

In this work, we propose an outer approximation algorithm for solving bounded convex
vector optimization problems (CVOPs). The scalarization model solved iteratively within the …

In this paper, we design a neural network architecture to approximate the weakly efficient
frontier of convex vector optimization problems (CVOP) satisfying Slater's condition. The …

We study geometric duality for convex vector optimization problems. For a primal problem
with a-dimensional objective space, we formulate a dual problem with a-dimensional …

There is an existing exact algorithm that solves DC programming problems if one
component of the DC function is polyhedral convex (Loehne, Wagner, 2017). Motivated by …

We also propose an algorithm (Algorithm 3) for solving DC programming problems directly.
In each iteration, Algorithm 3 updates the polyhedral underestimator of g locally while …