{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T16:08:47Z","timestamp":1762445327469,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"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":["NSFC11801131"],"award-info":[{"award-number":["NSFC11801131"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["No. A2019202229"],"award-info":[{"award-number":["No. A2019202229"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s12190-022-01797-w","type":"journal-article","created":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T09:03:37Z","timestamp":1664787817000},"page":"1403-1429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm"],"prefix":"10.1007","volume":"69","author":[{"given":"Lejia","family":"Gao","sequence":"first","affiliation":[]},{"given":"Bo","family":"Wen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"1797_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":"1797_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions invoving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"1797_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"3","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\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 3, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1797_CR4","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\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1797_CR5","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, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1797_CR6","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Wakin, M., Boyd, S.: Enhancing spasity by reweighted $$\\ell _{1}$$ minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","DOI":"10.1007\/s00041-008-9045-x"},{"key":"1797_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:JMIV.0000011321.19549.88","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vis. 20, 89\u201397 (2004)","journal-title":"J. Math. Imaging Vis."},{"key":"1797_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of \u201cFISTA\u2019\u2019. J. Optim. Theory Appl. 166, 25 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1797_CR9","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gaso","year":"2009","unstructured":"Gaso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Signal Process. 57, 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1797_CR10","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J.Z., Ye, J.: A general iterative shinkage and thresholding algorithm for non-convex regularized optimization problems. In: ICML (2013)"},{"key":"1797_CR11","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Preprint, METR 2015-27, Department of Mathematical Informatics, University of Tokyo. http:\/\/www.keisu.t.u-tokyo.ac.jp\/research\/techrep\/index.html"},{"key":"1797_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-016-2333-y","volume":"249","author":"HA Le Thi","year":"2017","unstructured":"Le Thi, H.A., Nguyen, M.C.: DCA based algorithms for feature selection in multi-class support vector machine. Ann. Oper. Res. 249, 273\u2013300 (2017)","journal-title":"Ann. Oper. Res."},{"key":"1797_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham, D.T.: 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":"1797_CR14","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":"1797_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Pham, D.T., Le, H.M., Vo, X.Y.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244, 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1797_CR16","unstructured":"Lin, Y., Li, S., Zhang, Y.Z.: Convergence rate analysis of accelerated forward\u2013backward algorithm with generalized Nesterov momentum scheme. arXiv: 2112.05873"},{"key":"1797_CR17","doi-asserted-by":"publisher","first-page":"2114","DOI":"10.1109\/TMI.2019.2898271","volume":"38","author":"Y Lin","year":"2019","unstructured":"Lin, Y., Schmidtlein, C.R., Li, Q., Li, S., Xu, Y.: A Krasnoselskii\u2013Mann algorithm with an improved EM preconditioner for PET image reconstruction. IEEE Trans. Med. Imaging 38, 2114\u20132126 (2019)","journal-title":"IEEE Trans. Med. Imaging"},{"key":"1797_CR18","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\u2013backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67, 489\u2013520 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1797_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-018-1327-8","volume":"176","author":"T Liu","year":"2018","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 (2018)","journal-title":"Math. Program."},{"key":"1797_CR20","doi-asserted-by":"crossref","unstructured":"Liu, T., Pong, T.K., Takeda, A.: A refined convergence analysis of pDCA$$_e$$ with applications to simultaneous sparse recovery and outlier detection. Math. Program. 176, 339\u2013367 (2019)","DOI":"10.1007\/s10107-018-1327-8"},{"key":"1797_CR21","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1137\/14098435X","volume":"8","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Zeng, T., Osher, S., Xin, J.: A weighted difference of anisotropic and isotropic total variation model for image processing. SIAM J. Imaging Sci. 8, 1798\u20131823 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"1797_CR22","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":"1797_CR23","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, 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"key":"1797_CR24","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.J.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"1797_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"J-S Pang","year":"2017","unstructured":"Pang, J.-S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42, 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"key":"1797_CR26","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"1797_CR27","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":"1797_CR28","volume-title":"Variational Analysis. Grundlehren der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften. Springer, Berlin (1998)"},{"key":"1797_CR29","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":"1797_CR30","unstructured":"Sun, K., Sun, X.A.: Algorithms for difference-of-convex (DC) programs based on difference-of-Moreau-envelopes smoothing. arXiv: 2104.01470"},{"key":"1797_CR31","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"62","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 62, 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"1797_CR32","doi-asserted-by":"crossref","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37, A536\u2013A563 (2015)","DOI":"10.1137\/140952363"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01797-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01797-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01797-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T13:22:20Z","timestamp":1679318540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01797-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,3]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1797"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01797-w","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2022,10,3]]},"assertion":[{"value":"8 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflicts of interest with regards to the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}