Improving the Robustness of Difference of Convex Algorithm in the Research of a Global Optimum of a Nonconvex Differentiable Function Defined on a Bounded Closed Interval

International audienceIn this paper we present an algorithm for solving a DC problem non convex on an interval [a, b] of R. We use the DCA (Difference of Convex Algorithm) and the minimum of the average of two approximations of the function from a and b.This strategy has the advantage of giving in general a minimum to be situated in the attraction zone of the global minimum searched. After applying the DCA from this minimum we certainly arrive at the global minimum searched

WITHDRAWN: Nonconvex optimization based on DC programming and DCA in the search of a global optimum of a nonconvex function

This article has been withdrawn at the request of the author(s) and/or editor. The Publisher apologizes for any inconvenience this may cause. The full Elsevier Policy on Article Withdrawal can be found at http://www.elsevier.com/locate/withdrawalpolicy