{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T06:10:09Z","timestamp":1770531009499,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T00:00:00Z","timestamp":1688083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T00:00:00Z","timestamp":1688083200000},"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 Science Foundation of China","doi-asserted-by":"crossref","award":["12261019"],"award-info":[{"award-number":["12261019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11075-023-01569-y","type":"journal-article","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T05:01:35Z","timestamp":1688101295000},"page":"207-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems"],"prefix":"10.1007","volume":"95","author":[{"given":"Ting","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,30]]},"reference":[{"issue":"2","key":"1569_CR1","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-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1569_CR2","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-\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1569_CR3","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., Svaier, 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, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1569_CR4","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward_backward method is actually faster than $$ {\\frac{1}{{{k^2}}}} $$. SIAM J. Optim. 26, 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"key":"1569_CR5","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/17M1114739","volume":"28","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Cabot, A.: Convergence rates of inertial forward-backward algorithms. SIAM J. Optim. 28, 849\u2013874 (2018)","journal-title":"SIAM J. Optim."},{"key":"1569_CR6","unstructured":"Ahookhosh, M., Themelis, A., Patrinos, P.: A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima (2019). arXiv preprint arXiv:1905.11904"},{"key":"1569_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10107-018-1350-9","volume":"180","author":"V Apidopoulos","year":"2020","unstructured":"Apidopoulos, V., Aujol, J., Dossal, C.: Convergence rate of inertial Forward-Backward algorithm beyond Nesterov\u2019s rule. Math. Program. 180, 137\u2013156 (2020)","journal-title":"Math. Program."},{"key":"1569_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01476-3","author":"V Apidopoulos","year":"2020","unstructured":"Apidopoulos, V., Aujol, J., Dossal, C., et al.: Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01476-3","journal-title":"Math. Program."},{"key":"1569_CR9","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. PrenticeHall, New Jersey (1989)"},{"issue":"1","key":"1569_CR10","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(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1569_CR11","doi-asserted-by":"crossref","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems.in IEEE Transactions on Image Processing. 18, 2419-2434 (2009)","DOI":"10.1109\/TIP.2009.2028250"},{"key":"1569_CR12","doi-asserted-by":"crossref","unstructured":"Bolte, J., Sabach, S., Teboulle. M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1-2), 459-494 (2014)","DOI":"10.1007\/s10107-013-0701-9"},{"key":"1569_CR13","doi-asserted-by":"crossref","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the fast iterative shrinkage-thresholding algorithm J. Optim. Theory Appl. 166, 968\u2013982 (2015)","DOI":"10.1007\/s10957-015-0746-4"},{"key":"1569_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numerica. 25, 161\u2013319 (2015)","journal-title":"Acta Numerica."},{"key":"1569_CR15","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, 1\u201327 (2011)","journal-title":"ACM. Trans. Intell. Syst. Technol."},{"issue":"11","key":"1569_CR16","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"key":"1569_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M108940X","volume":"28","author":"K Donghwan","year":"2018","unstructured":"Donghwan, K., Jeffrey, A.F.: Another look at the fast iterative shrinkage thresholding algorithm (FISTA). SIAM J. Optim. 28, 223\u2013250 (2018)","journal-title":"SIAM J. Optim."},{"key":"1569_CR18","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"1569_CR19","unstructured":"Fercoq, O., Qu, Z.: Restarting accelerated gradient methods with a rough strong convexity estimate (2016). arXiv preprint arXiv:1609.07358"},{"key":"1569_CR20","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1093\/imanum\/drz007","volume":"39","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Qu, Z.: Adaptive restart of accelerated gradient methods under local quadratic growth condition. IMA J. Numer Anal. 39, 2069\u20132095 (2019)","journal-title":"IMA J. Numer Anal."},{"key":"1569_CR21","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1109\/TSP.2017.2778695","volume":"66","author":"F Ghayem","year":"2018","unstructured":"Ghayem, F., Sadeghi, M., Babaie-Zadeh, M., Chatterjee, S., Skoglund, M., Jutten, C.: Sparse signal recovery using iterative proximal projection. IEEE Trans. Signal Process. 66, 879\u2013894 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"1569_CR22","unstructured":"Hien, L.T.K., Gillis, N., Patrinos, P.: Inertial block mirror descent method for non-convex non-smooth optimization (2019). arXiv preprint arXiv:1903.01818"},{"key":"1569_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-017-9896-7","volume":"67","author":"PR Johnstone","year":"2017","unstructured":"Johnstone, P.R., Moulin, P.: Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions. Comput. Optim. Appl. 67, 259\u2013292 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1569_CR24","unstructured":"Liu, H.W., Wang, T., Liu, Z.X.: Convergence rate of inertial forward-backward algorithms based on the local error bound condition. http:\/\/arxiv.org\/pdf\/2007.07432"},{"key":"1569_CR25","unstructured":"Liu, H.W., Wang, T., Liu, Z.X.: Some modified fast iteration shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems. Optimization online. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/12\/8169.html"},{"key":"1569_CR26","unstructured":"Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. International Conference on Machine Learning. PMLR, 73\u201381 (2014)"},{"key":"1569_CR27","unstructured":"Liang, J, Sch\u00f6nlieb, C.B.: Improving FISTA: Faster, smarter and greedier (2018). arXiv preprint arXiv:1811.01430"},{"key":"1569_CR28","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Proceedings of NeurIPS, 379-387 (2015)"},{"key":"1569_CR29","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/19M1298007","volume":"2","author":"MC Mukkamala","year":"2020","unstructured":"Mukkamala, M.C., Ochs, P., Pock, T., et al.: Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization. SIAM J. Math. Data Sci. 2, 658\u2013682 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"1569_CR30","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O\\left( {\\frac{1}{{{k^2}}}} \\right)$$. Dokl. Akad. Nauk SSSR. 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR."},{"key":"1569_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1569_CR32","doi-asserted-by":"publisher","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. Academic Publishers, Boston (2004)"},{"key":"1569_CR33","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New-York (1970)"},{"issue":"2","key":"1569_CR34","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., et al.: iPiano: Inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"1569_CR35","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.: Adaptive restart for accelerated gradient schemes. Found Comput Math. 15, 715\u2013732 (2015)","journal-title":"Found Comput Math."},{"key":"1569_CR36","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imaging Sci. 9, 1756\u20131787 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"1569_CR37","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1, 127\u2013239 (2014)","journal-title":"Proximal algorithms. Found. Trends Optim."},{"key":"1569_CR38","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/18M1224568","volume":"30","author":"V Roulet","year":"2020","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart, and acceleration. SIAM J. Optim. 30, 262\u2013289 (2020)","journal-title":"SIAM J. Optim."},{"key":"1569_CR39","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Candes, E.J.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights. J. Mach. Learn. Res. 17, 1\u201343 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1569_CR40","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X.J., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"key":"1569_CR41","doi-asserted-by":"crossref","unstructured":"Wu, Z.M., Li, C.S., Li, M., Lim, A.: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J Global Optim. https:\/\/doi.org\/10.1007\/s10898-020-00943-7","DOI":"10.1007\/s10898-020-00943-7"},{"key":"1569_CR42","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10589-019-00073-1","volume":"73","author":"ZM Wu","year":"2019","unstructured":"Wu, Z.M., Li, M.: General inertial proximal gradient method for a class of onconvex nonsmooth optimizaiton problems. Comput. Optim. Appl. 73, 129\u2013158 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"7","key":"1569_CR43","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X.Y., Xu, F.M., Zhang, H.: L1\/2 Regularization: A Thresholding Representation Theory and a Fast Solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1569_CR44","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems (2017). arXiv preprint arXiv:1711.06831"},{"key":"1569_CR45","doi-asserted-by":"publisher","first-page":"3402","DOI":"10.1137\/17M1130113","volume":"28","author":"L Yang","year":"2018","unstructured":"Yang, L., Pong, T.K., Chen, X.: A non-monotone alternating updating method for a class of matrix factorization problems. SIAM J. Optim 28, 3402\u20133430 (2018)","journal-title":"SIAM J. Optim"},{"key":"1569_CR46","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"1569_CR47","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/02331888.2012.719513","volume":"48","author":"LM Zeng","year":"2014","unstructured":"Zeng, L.M., Xie, J.: Group variable selection via SCAD-l2. Statistics. 48, 49\u201366 (2014)","journal-title":"Statistics."},{"key":"1569_CR48","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J-B.: Variational Analysis. Springer, 1998","DOI":"10.1007\/978-3-642-02431-3"},{"issue":"1","key":"1569_CR49","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. Mathematical Programming. 137(1), 91\u2013129 (2013)","journal-title":"Mathematical Programming."},{"issue":"3","key":"1569_CR50","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10957-014-0642-3","volume":"165","author":"P Frankel","year":"2015","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka-\u0141ojasiewicz functions and general convergence rates. Journal of Optimization Theory and Applications. 165(3), 874\u2013900 (2015)","journal-title":"Journal of Optimization Theory and Applications."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01569-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01569-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01569-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T10:34:45Z","timestamp":1704364485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01569-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,30]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1569"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01569-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,30]]},"assertion":[{"value":"30 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2023","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}