Solving DC programs using the cutting angle method
Rights accessOpen Access
In this paper, we propose a new algorithm for global minimization of functions represented as a difference of two convex functions. The proposed method is a derivative free method and it is designed by adapting the extended cutting angle method. We present preliminary results of numerical experiments using test problems with difference of convex objective functions and box-constraints. We also compare the proposed algorithm with a classical one that uses prismatical subdivisions.
CitationFerrer, A.; Bagirov, A.; Beliakov, G. Solving DC programs using the cutting angle method. "Journal of global optimization", Febrer 2014, vol. Online First, p. 1-19.