Trying to learn how to translate from the human translation examples.
From professional translators, enterprises, web pages and freely available translation repositories.
and also considered the "convex" closure of a problem of non-convex minimization—that is, the problem defined as the closed convex hull of the epigraph of the original problem.
and also considered the "convex" closure of a problem of non-convex minimization—that is, the problem defined as the closed convex hull of the epigraph of the original problem.
comparing the left array and the right pane, one confirms that the right-hand plus-symbol is indeed the sum of the four plus-symbols from the left-hand sets, precisely two points from the original non-convex summand-sets and two points from the convex hulls of the remaining summand-sets.__the shapley–folkman lemma is illustrated by the minkowski addition of four sets.
comparing the left array and the right pane, one confirms that the right-hand plus-symbol is indeed the sum of the four plus-symbols from the left-hand sets, precisely two points from the original non-convex summand-sets and two points from the convex hulls of the remaining summand-sets._: {0, 1} + {0, 1} = {0 + 0, 0 + 1, 1 + 0, 1 + 1} = {0, 1, 2}.