Le Thi Hoai An, Pham DinhTao: "The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems".

Abstract: The DC programming and its DC algorithm (DCA) address the problem of minimizing a function f=g−h (with g,h being lower semicontinuous proper convex functions on R) on the whole space. Based on local optimality conditions and DC duality, DCA was successfully applied to a lot of different and various nondifferentiable nonconvex optimization problems to which it quite often gave global solutions and proved to be more robust and more efficient than related standard methods, especially in the large scale setting. The computational efficiency of DCA suggests to us a deeper and more complete study on DC programming, using the special class of DC programs (when eitherg or h is polyhedral convex) called polyhedral DC programs. The DC duality is investigated in an easier way, which is more convenient to the study of optimality conditions. New practical results on local optimality are presented. We emphasize regularization techniques in DC programming in order to construct suitable equivalent DC programs to nondifferentiable nonconvex optimization problems and new significant questions which have to be answered. A deeper insight into DCA is introduced which really sheds new light on DCA and could partly explain its efficiency. Finally DC models of real world nonconvex optimization are reported.

 

Keywords: DC programming, DC algorithms (DCA), DC duality, local optimality conditions, global optimality conditions, polyhedral DC programming, regularization techniques.

 

Citation: Le Thi Hoai An and Pham DinhTao, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Annals of Operations Research, vol 133, pp. 23- 46, 2005.

 

Download link