Liu, T., Pong, T. K., & Takeda, A. (2019). A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Mathematical programming, 176(1-2), 339-367. https://doi.org/10.1007/s10107-018-1327-8
Chicago Style (17th ed.) CitationLiu, Tianxiang, Ting Kei Pong, and Akiko Takeda. "A Successive Difference-of-convex Approximation Method for a Class of Nonconvex Nonsmooth Optimization Problems." Mathematical Programming 176, no. 1-2 (2019): 339-367. https://doi.org/10.1007/s10107-018-1327-8.
MLA (9th ed.) CitationLiu, Tianxiang, et al. "A Successive Difference-of-convex Approximation Method for a Class of Nonconvex Nonsmooth Optimization Problems." Mathematical Programming, vol. 176, no. 1-2, 2019, pp. 339-367, https://doi.org/10.1007/s10107-018-1327-8.