Convexification for a Class of Global Optimization Problems with C1,1 Functions

A general convexification method via domain transformation scheme is presented for solving a class of global optimization problems with certain monotone properties. It is shown that this class of problems with C-1,C-1 functions can be converted into equivalent convex optimization problems by using the proposed convexification method. Finally, an example is shown to illustrate how a monotone non-convex optimization problem can be transformed into an equivalent convex minimization problem.