Algorithms for globally solving DC minimization problems via concave programming

Several methods have been proposed for solving a DC (difference of two convex functions) programming problem, but very few have been done on parallel approach. In this paper, three algorithms suitable for parallel implementation are presented to solve a DC problem via solving an equivalent concave minimization problem. To distribute the computation load as evenly as possible, a simplex subdivision process such as bisection, triangulation or other partition procedures of simplices are employed. Some numerical test results are reported and comparison of these algorithms are given