{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:24:55Z","timestamp":1774610695790,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371173"],"award-info":[{"award-number":["11371173"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301222"],"award-info":[{"award-number":["11301222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Central University Fund","award":["21615453"],"award-info":[{"award-number":["21615453"]}]},{"name":"Central University Fund","award":["21617417"],"award-info":[{"award-number":["21617417"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11590-018-1280-8","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T11:40:49Z","timestamp":1528717249000},"page":"805-824","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The modified second APG method for DC optimization problems"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3122-0914","authenticated-orcid":false,"given":"Daoling","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunguang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"1280_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer Academic Publisher, Dordrecht (2004)"},{"key":"1280_CR2","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"1280_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125, 263\u2013295 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"1280_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Thi Le","year":"2008","unstructured":"Le Thi, H.A., Le Hoai, M., Nguyen, V.V., Pham Dinh, T.: A dc programming approach for feature selection in support vector machines learning. Adv. Data Anal. Classif. 2(3), 259\u2013278 (2008)","journal-title":"Adv. Data Anal. Classif."},{"issue":"1","key":"1280_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Thi Le","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1280_CR6","doi-asserted-by":"publisher","first-page":"2984","DOI":"10.1109\/TSP.2014.2315167","volume":"62","author":"A Alvarado","year":"2014","unstructured":"Alvarado, A., Scutari, G., Pang, J.S.: A new decomposition method for multiuser DC programming and its applications. IEEE Trans. Signal Process. 62, 2984\u20132998 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1280_CR7","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $$L_{1}$$ L 1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. arXiv preprint arXiv:1441.5735v3"},{"key":"1280_CR8","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1109\/TSP.2014.2303946","volume":"62","author":"M Sanjabi","year":"2014","unstructured":"Sanjabi, M., Razaviyayn, M., Luo, Z.-Q.: Optimal joint base station assignment and beamforming for heterogeneous networks. IEEE Trans. Signal Process. 62, 1950\u20131961 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1280_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-1-4757-6019-4_13","volume-title":"Nonsmooth Optimization and Related Topics","author":"JB Hiriart-Urruty","year":"1989","unstructured":"Hiriart-Urruty, J.B.: From convex optimization to nonconvex optimization necessary and sufficient conditions for global optimization. In: Clarke, F.H., Dem\u2019yanov, V.F., Giannessi, F. (eds.) Nonsmooth Optimization and Related Topics, vol. 43, pp. 219\u2013240. Plenum Press, New York (1989)"},{"key":"1280_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-45610-7_3","volume-title":"Convexity and Duality in Optimization. Lecture Notes in Economics And Mathematical Systems","author":"JB Hiriart-Urruty","year":"1986","unstructured":"Hiriart-Urruty, J.B.: Generalized differentiability, duality and optimization for problems dealing with difference of convex functions. In: Ponstein, J. (ed.) Convexity and Duality in Optimization. Lecture Notes in Economics And Mathematical Systems, vol. 256, pp. 37\u201370. Springer, Berlin (1986)"},{"key":"1280_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01580759","volume":"41","author":"JB Hiriart-Urruty","year":"1988","unstructured":"Hiriart-Urruty, J.B., Tuy, H.: Essays on nonconvex optimization. Math. Program. 41, 229\u2013248 (1988)","journal-title":"Math. Program."},{"key":"1280_CR12","unstructured":"Auchmuty, G.: Duality algorithm for nonconvex variational principle. Research Report UH\/MD-41, University of Houston (1988)"},{"key":"1280_CR13","unstructured":"Pham Dinh, T., Souad, E.B.: Algorithms for solving a class of nonconvex optimizations problems: methods of subgradient. Fermat Day 85: Mathematics for Optimization, North Holland (1986)"},{"issue":"4","key":"1280_CR14","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.3934\/jimo.2016.12.1349","volume":"12","author":"J Gu","year":"2016","unstructured":"Gu, J., Xiao, X., Zhang, L.: A subgradient-based convex approximations method for DC programming and its applications. J. Ind. Manag. Optim. 12(4), 1349\u20131366 (2016)","journal-title":"J. Ind. Manag. Optim."},{"key":"1280_CR15","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithm and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"1","key":"1280_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3934\/jimo.2014.10.243","volume":"10","author":"HA Thi Le","year":"2014","unstructured":"Le Thi, H.A., Quynh, T.D., Adjallah, K.H.: A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors. J. Ind. Manag. Optim. 10(1), 243\u2013258 (2014)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"1280_CR17","doi-asserted-by":"publisher","first-page":"817","DOI":"10.3934\/jimo.2014.10.817","volume":"10","author":"C Wu","year":"2014","unstructured":"Wu, C., Li, C., Long, Q.: A DC programming approach for senor network localization with uncertainties in anchor positions. J. Ind. Manag. Optim. 10(3), 817\u2013826 (2014)","journal-title":"J. Ind. Manag. Optim."},{"key":"1280_CR18","doi-asserted-by":"publisher","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for spare optimization problems. Math. Program. Ser. B. https:\/\/doi.org\/10.1007\/s10107-107-1181-0","DOI":"10.1007\/s10107-107-1181-0"},{"key":"1280_CR19","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","unstructured":"Pham, D.T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"1280_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJA Artacho","year":"2018","unstructured":"Artacho, F.J.A., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169, 95\u2013118 (2018)","journal-title":"Math. Program."},{"key":"1280_CR21","doi-asserted-by":"crossref","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A successive difference-of-convex approximation method for a class of nonconvex nonmooth optimization problems. Preprint, 2017. http:\/\/arxiv.org\/abs\/1710.05778","DOI":"10.1007\/s10107-018-1327-8"},{"key":"1280_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-conex algorithm with extrapolation. Comput. Optim. Appl. 69, 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"1280_CR23","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1280_CR24","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. CORE Discussion Paper (2007)"},{"key":"1280_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, New York (1998)"},{"key":"1280_CR26","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-Lojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1280_CR27","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1280_CR28","doi-asserted-by":"publisher","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013Lojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. https:\/\/doi.org\/10.1007\/s10208-017-9366-8","DOI":"10.1007\/s10208-017-9366-8"},{"key":"1280_CR29","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1137\/070689838","volume":"19","author":"WH Yang","year":"2009","unstructured":"Yang, W.H.: Error bounds for convex polynomials. SIAM J. Optim. 19, 1633\u20131647 (2009)","journal-title":"SIAM J. Optim."},{"key":"1280_CR30","first-page":"271","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Progam. 165, 271\u2013507 (2017)","journal-title":"Math. Progam."},{"key":"1280_CR31","unstructured":"Liu, H., Wu, W., SO, A. M.-C.: Quadratic optimization with orthogonality constraints: explicit Lojasiewicz exponent and linear convergence of line-search methods. In: Proceedings of the 33rd International Conference on Machine Learning (ICML 2016), pp. 1158\u20131167 (2016)"},{"key":"1280_CR32","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Progam. Ser. A 146, 459\u2013494 (2014)","journal-title":"Math. Progam. Ser. A"},{"key":"1280_CR33","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume":"49","author":"PL Combettes","year":"2012","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. Fixed Point Algorithms Inverse Probl. Sci. Eng. 49, 185\u2013212 (2012)","journal-title":"Fixed Point Algorithms Inverse Probl. Sci. Eng."},{"key":"1280_CR34","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$l_{1-2}$$ l 1 - 2 foe compressed sensing. SIAM J. Sci. Comput. 37, 536\u2013563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"1280_CR35","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M., Boyd, S.: Enhancing spasity by reweighted $$l_{1}$$ l 1 minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"1280_CR36","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10589-017-9900-2","volume":"67","author":"T Liu","year":"2017","unstructured":"Liu, T., Pong, T.K.: Further properties of the forward-backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67(3), 489\u2013520 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1280_CR37","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538\u2013543 (1993)","journal-title":"SIAM J. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1280-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1280-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1280-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T12:20:53Z","timestamp":1661430053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1280-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1280"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1280-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"29 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}