Open issues and recent advances in DC programming and DCA - Université de Lorraine Access content directly
Journal Articles Journal of Global Optimization Year : 2024

Open issues and recent advances in DC programming and DCA


DC (difference of convex functions) programming and DC algorithm (DCA) are powerful tools for nonsmooth nonconvex optimization. This field was created in 1985 by Pham Dinh Tao in its preliminary state, then the intensive research of the authors of this paper has led to decisive developments since 1993, and has now become classic and increasingly popular worldwide. For 35 years from their birthday, these theoretical and algorithmic tools have been greatly enriched, thanks to a lot of their applications, by researchers and practitioners in the world, to model and solve nonconvex programs from many fields of applied sciences. This paper is devoted to key open issues, recent advances and trends in the development of these tools to meet the growing need for nonconvex programming and global optimization. We first give an outline in foundations of DC programming and DCA which permits us to highlight the philosophy of these tools, discuss key issues, formulate open problems, and bring relevant answers. After outlining key open issues that require deeper and more appropriate investigations, we will present recent advances and ongoing works in these issues. They turn around novel solution techniques in order to improve DCA’s efficiency and scalability, a new generation of algorithms beyond the standard framework of DC programming and DCA for large-dimensional DC programs and DC learning with Big data, as well as for broader classes of nonconvex problems beyond DC programs.
No file

Dates and versions

hal-04003745 , version 1 (24-02-2023)



Hoai An Le Thi, Tao Pham Dinh. Open issues and recent advances in DC programming and DCA. Journal of Global Optimization, 2024, 88, pp.533-590. ⟨10.1007/s10898-023-01272-1⟩. ⟨hal-04003745⟩
66 View
0 Download



Gmail Facebook X LinkedIn More