{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:25:09Z","timestamp":1774610709759,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:00:00Z","timestamp":1720224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Project No. 12071157"],"award-info":[{"award-number":["Project No. 12071157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s11590-024-02132-x","type":"journal-article","created":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T15:01:59Z","timestamp":1720278119000},"page":"747-770","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The modified second APG method for a class of nonconvex nonsmooth problems"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8270-4711","authenticated-orcid":false,"given":"Kexin","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunguang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lumiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,6]]},"reference":[{"issue":"1","key":"2132_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LTH An","year":"2005","unstructured":"An, L.T.H., Tao, P.D.: The dc (difference of convex functions) programming and dca revisited with dc models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2132_CR2","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 regularized gauss-seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"2132_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L., et al.: Convex analysis and monotone operator theory in Hilbert spaces, vol. 408. Springer, Berlin (2011)"},{"issue":"1","key":"2132_CR4","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. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"2132_CR5","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1287\/moor.2021.1214","volume":"47","author":"RI Bo\u0163","year":"2022","unstructured":"Bo\u0163, R.I., Dao, M.N., Li, G.: Extrapolated proximal subgradient algorithms for nonconvex and nonsmooth fractional programs. Math. Oper. Res. 47(3), 2415\u20132443 (2022)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2132_CR6","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bo\u0163","year":"2020","unstructured":"Bo\u0163, R.I., Nguyen, D.K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Math. Oper. Res. 45(2), 682\u2013712 (2020)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"2132_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Candes","year":"2012","unstructured":"Candes, E., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"issue":"5","key":"2132_CR8","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.B., Boyd, S.P.: Enhancing sparsity by reweighted l1 minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"2132_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"2132_CR10","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1137\/15M1028054","volume":"26","author":"X Chen","year":"2016","unstructured":"Chen, X., Lu, Z., Pong, T.K.: Penalty methods for a class of non-lipschitz optimization problems. SIAM J. Optim. 26(3), 1465\u20131492 (2016)","journal-title":"SIAM J. Optim."},{"key":"2132_CR11","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"2132_CR12","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: International Conference on Machine Learning, pp. 37\u201345. PMLR (2013)"},{"issue":"1","key":"2132_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"Jy Gotoh","year":"2018","unstructured":"Gotoh, Jy., Takeda, A., Tono, K.: Dc formulations and algorithms for sparse optimization problems. Math. Program. 169(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"issue":"5","key":"2132_CR14","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013\u0142ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"2132_CR15","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s11590-018-1280-8","volume":"13","author":"D Lin","year":"2019","unstructured":"Lin, D., Liu, C.: The modified second apg method for dc optimization problems. Optim. Lett. 13(4), 805\u2013824 (2019)","journal-title":"Optim. Lett."},{"issue":"1","key":"2132_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-019-00067-z","volume":"73","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A refined convergence analysis of pDCA$$_{e}$$ with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73(1), 69\u2013100 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"8","key":"2132_CR17","doi-asserted-by":"publisher","first-page":"2831","DOI":"10.1007\/s11590-021-01716-1","volume":"15","author":"S Nakayama","year":"2021","unstructured":"Nakayama, S., Gotoh, Jy.: On the superiority of pgms to pdcas in nonsmooth nonconvex sparse regression. Optim. Lett. 15(8), 2831\u20132860 (2021)","journal-title":"Optim. Lett."},{"key":"2132_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Kluwer, Dordrecht (2004)"},{"key":"2132_CR19","unstructured":"Qian, Y., Pan, S.: Convergence of a class of nonmonotone descent methods for kl optimization problems. arXiv preprint arXiv:2201.00639 (2022)"},{"key":"2132_CR20","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"1","key":"2132_CR21","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., An, L.H.: Convex analysis approach to dc programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"2","key":"2132_CR22","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(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"2132_CR23","unstructured":"Van Luong Le, F.L., Bloch, G.: Selective l1 minimization for sparse recovery"},{"issue":"1","key":"2132_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01677-8","volume":"90","author":"W Wang","year":"2022","unstructured":"Wang, W., Chen, Y.: An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing. J. Sci. Comput. 90(1), 1\u201328 (2022)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2132_CR25","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27(1), 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2132_CR26","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-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"2132_CR27","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.patrec.2016.11.016","volume":"85","author":"Y Xiao","year":"2017","unstructured":"Xiao, Y., Wang, H., Xu, W.: Ramp loss based robust one-class svm. Pattern Recognit. Lett. 85, 15\u201320 (2017)","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"2132_CR28","doi-asserted-by":"publisher","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of 1\u20132 for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2132_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108630","volume":"172","author":"W Zhu","year":"2022","unstructured":"Zhu, W., Song, Y., Xiao, Y.: Robust support vector machine classifier with truncated loss function by gradient algorithm. Comput. Ind. Eng. 172, 108630 (2022)","journal-title":"Comput. Ind. Eng."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02132-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02132-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02132-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T05:37:35Z","timestamp":1744695455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02132-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,6]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2132"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02132-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,6]]},"assertion":[{"value":"7 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}