Global minimization simplicial algorithm for concave minorant optimization problem

In present paper, we investigate a class of concave minorant optimization problems. We show that a method for globally minimizing a Lipschitz function over a polytope can be generalized to minimize a function with concave minorants over a polytope. Moreover, another approach may be used for the important problem of minimizing a D.C. function over a polytope.