Convexification, concavification and monotonization in global optimization (Q5959334): Difference between revisions

The authors introduce a new approach by which via certain convexification, concavification and monotonization schemes a nonconvex optimization problem, over a simplex, can be converted into an equivalent better-structured nonconvex one. In this way studying a concave optimization problem or a D.C. (where D.C. stands for the difference of two convex functions) by means of the analytical tools proposed, the authors solve some interesting global optimization problems. The novel approach introduced in this paper, de facto, closes a gap between the generality and efficency in the current literature of global optimization.