A well-known strategy for obtaining a lower bound on the minimum of a d.c. function f−g over a compact convex set S⊂ℝ<Superscript>n</Superscript> consists of replacing the convex function f by a linear minorant at x <Subscript>0</Subscript>∈S. In this note we show that the x <Subscript>0</Subscript> <Superscript>*</Superscript> giving the optimal bound can be obtained by solving a...</superscript></subscript></subscript></superscript>

A well-known strategy for obtaining a lower bound on the minimum of a d.c. function f−g over a compact convex set S⊂ℝ n consists of replacing the convex function f by a linear minorant at x 0 ∈S. In this note we show that the x 0 * giving the optimal bound can be obtained by solving a...