| 1 | -- | 4 | Hoai An Le Thi, Tao Pham Dinh. Preface |
| 5 | -- | 68 | Hoai An Le Thi, Tao Pham Dinh. DC programming and DCA: thirty years of developments |
| 69 | -- | 94 | Amir Ali Ahmadi, Georgina Hall. DC decomposition of nonconvex polynomials with algebraic techniques |
| 95 | -- | 118 | Francisco J. Aragón Artacho, Ronan M. T. Fleming, Phan T. Vuong. Accelerating the DC algorithm for smooth functions |
| 119 | -- | 140 | Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales. Visualizing data as objects by DC (difference of convex) optimization |
| 141 | -- | 176 | Jun-ya Gotoh, Akiko Takeda, Katsuya Tono. DC formulations and algorithms for sparse optimization problems |
| 177 | -- | 198 | Jae-Hyoung Lee, Gue Myung Lee. On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint |
| 199 | -- | 219 | Takanori Maehara, Naoki Marumo, Kazuo Murota. Continuous relaxation for discrete DC programming |
| 221 | -- | 254 | Francisco Jara-Moroni, Jong-Shi Pang, Andreas Wächter. A study of the difference-of-convex approach for solving linear programs with complementarity constraints |
| 255 | -- | 275 | Chenchen wu, Yishui Wang, Zaixin Lu, Panos M. Pardalos, Dachuan Xu, Zhao Zhang, Ding-Zhu Du. Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming |
| 277 | -- | 305 | Chong Zhang, Minh Pham, Sheng Fu, Yufeng Liu. Robust multicategory support vector machines using difference convex algorithm |
| 307 | -- | 336 | Shuai Zhang, Jack Xin. 1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing |