{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T17:45:04Z","timestamp":1759772704441,"version":"3.41.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Open Fund of Tianjin Key Lab for Advanced Signal Processing","award":["No. 2022ASP-TJ01"],"award-info":[{"award-number":["No. 2022ASP-TJ01"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 12271273"],"award-info":[{"award-number":["No. 12271273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10957-025-02689-2","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T09:16:33Z","timestamp":1747300593000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Contractive Difference-of-Convex Algorithms"],"prefix":"10.1007","volume":"206","author":[{"given":"Songnian","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6765-4437","authenticated-orcid":false,"given":"Qiao-Li","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael Th.","family":"Rassias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"key":"2689_CR1","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":"2689_CR2","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, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"2689_CR3","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Vuong, P.T.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30, 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"2689_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-018-1292-2","volume":"178","author":"S Banert","year":"2019","unstructured":"Banert, S., Bot, R.I.: A general double-proximal gradient algorithm for d.c. programming. Math. Program. 178, 301\u2013326 (2019)","journal-title":"Math. Program."},{"key":"2689_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)","edition":"2"},{"key":"2689_CR6","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":"2689_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. 169, 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"2689_CR8","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11228-020-00566-w","volume":"28","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira, W.: The ABC of DC Programming. Set-Valued Var. Anal. 28, 679\u2013706 (2020)","journal-title":"Set-Valued Var. Anal."},{"key":"2689_CR9","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10898-018-0727-x","volume":"73","author":"QL Dong","year":"2019","unstructured":"Dong, Q.L., Huang, J.Z., Li, X.H., et al.: MiKM: multi-step inertial Krasnosel\u2019ski\u01d0-Mann algorithm and its applications. J. Glob. Optim. 73, 801\u2013824 (2019)","journal-title":"J. Glob. Optim."},{"key":"2689_CR10","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.neunet.2020.08.024","volume":"132","author":"HA Le Thi","year":"2020","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression. Neural Networks 132, 220\u2013231 (2020)","journal-title":"Neural Networks"},{"key":"2689_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-88192-6_8","volume":"5139","author":"HA Le Thi","year":"2008","unstructured":"Le Thi, H.A., Nguyen, V.V., Ouchani, S.: Gene selection for cancer classification using DCA. International Conference on Advanced Data Mining and Applications. 5139, 62\u201372 (2008)","journal-title":"International Conference on Advanced Data Mining and Applications."},{"key":"2689_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-023-01272-1","author":"HA Le Thi","year":"2023","unstructured":"Le Thi, H.A., Pham Dinh, T.: Open issues and recent advances in DC programming and DCA. J. Glob. Optim. (2023). https:\/\/doi.org\/10.1007\/s10898-023-01272-1","journal-title":"J. Glob. Optim."},{"key":"2689_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham, D.T.: DC programming and DCA: thirty years of developments. Math. Program. 169, 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"2689_CR14","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, 805\u2013824 (2019)","journal-title":"Optim. Lett."},{"key":"2689_CR15","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 pDCAe with applications to simultaneous sparse recovery and outlier detection. Comput. Optim. Appl. 73, 69\u2013100 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2689_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-018-1327-8","volume":"176","author":"T Liu","year":"2019","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Program. 176, 339\u2013367 (2019)","journal-title":"Math. Program."},{"key":"2689_CR17","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast L1\u2013L2 Minimization via a proximal operator. J. Sci. Comput. 74, 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"2689_CR18","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1137\/18M1214342","volume":"29","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z.: Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming. SIAM J. Optim. 29(4), 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"key":"2689_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-018-1318-9","volume":"176","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176, 369\u2013401 (2019)","journal-title":"Math. Program."},{"key":"2689_CR20","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^2)$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983). ((in Russian))","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2689_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0041-5553(68)90045-1","volume":"8","author":"L Oblomskaja","year":"1968","unstructured":"Oblomskaja, L.: Methods of successive approximation for linear equations in Banach spaces. USSR Compt. Math. and Math. Phys. 8, 239\u2013253 (1968)","journal-title":"USSR Compt. Math. and Math. Phys."},{"issue":"2","key":"2689_CR22","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: Inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2689_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"JS Pang","year":"2017","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"key":"2689_CR24","unstructured":"Pham, T.N., Dao, M.N., Amjady, N., Shah, R.: A proximal splitting algorithm for generalized DC programming with applications in signal recovery, 2024 arxiv:2409.01535"},{"key":"2689_CR25","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"2689_CR26","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":"2689_CR27","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)"},{"key":"2689_CR28","doi-asserted-by":"crossref","unstructured":"Phan, D.N., Le, H.M., Le Thi, H.A.: Accelerated difference of convex functions algorithm and its application to sparse binary logistic regression. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI-18, pp. 1369-1375. International Joint Conferences on Artificial Intelligence Organization (2018)","DOI":"10.24963\/ijcai.2018\/190"},{"key":"2689_CR29","unstructured":"Poon, C.. Liang, J.: Geometry of first-order methods and adaptive acceleration, arXiv:2003 .03910"},{"key":"2689_CR30","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"4","key":"2689_CR31","first-page":"451","volume":"21","author":"WY Sun","year":"2003","unstructured":"Sun, W.Y., Sampaio, R.J.B., Candido, M.A.B.: Proximal point algorithm for minimization of DC Functions. J. Comput. Math. 21(4), 451\u2013462 (2003)","journal-title":"J. Comput. Math."},{"issue":"4","key":"2689_CR32","first-page":"499","volume":"20","author":"K Syrtseva","year":"2024","unstructured":"Syrtseva, K., de Oliveira, W., Demassey, S., van Ackooij, W.: Minimizing the difference of convex and weakly convex functions via bundle method. Pac. J. Optim. 20(4), 499\u2013741 (2024)","journal-title":"Pac. J. Optim."},{"key":"2689_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization, 2nd edn. Springer, Berlin (2016)","edition":"2"},{"key":"2689_CR34","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":"2689_CR35","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/s10957-011-9837-z","volume":"150","author":"HK Xu","year":"2011","unstructured":"Xu, H.K.: Averaged mappings and the gradient-projection algorithm. J. Optim. Theory Appl. 150, 360\u2013378 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"2689_CR36","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1007\/s10107-022-01888-3","volume":"198","author":"JJ Ye","year":"2023","unstructured":"Ye, J.J., Yuan, X., Zeng, S., Zhang, J.: Difference of convex algorithms for bilevel programs with applications in hyperparameter selection. Math. Program. 198, 1583\u20131616 (2023)","journal-title":"Math. Program."},{"issue":"1","key":"2689_CR37","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 $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2689_CR38","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1137\/20M1314057","volume":"31","author":"P Yu","year":"2021","unstructured":"Yu, P., Pong, T.K., Lu, Z.: Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems. SIAM J. Optim. 31, 2024\u20132054 (2021)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02689-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02689-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02689-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T13:51:45Z","timestamp":1748613105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02689-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,15]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2689"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02689-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,5,15]]},"assertion":[{"value":"3 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}