{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:08:41Z","timestamp":1770815321236,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"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":["12172266"],"award-info":[{"award-number":["12172266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s40314-024-02922-0","type":"journal-article","created":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T09:01:19Z","timestamp":1728205279000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On inertial non-lipschitz stepsize algorithms for split feasibility problems"],"prefix":"10.1007","volume":"43","author":[{"given":"Xiaojun","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifu","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,6]]},"reference":[{"key":"2922_CR1","volume-title":"Fixed Point Theory for Lipschitzian-Type Mappings with Applications. Topological Fixed Point Theory and Its Applications","author":"RP Agarwal","year":"2009","unstructured":"Agarwal RP, Regan DO, Sahu DR (2009) Fixed Point Theory for Lipschitzian-Type Mappings with Applications. Topological Fixed Point Theory and Its Applications. Springer, New York USA"},{"key":"2922_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/S1052623403427859","volume":"14","author":"F Alvarez","year":"2004","unstructured":"Alvarez F (2004) Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert spaces. SIAM J Optim 14:773\u2013782","journal-title":"SIAM J Optim"},{"key":"2922_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez F, Attouch H (2001) An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal 9:3\u201311","journal-title":"Set-Valued Anal"},{"key":"2922_CR4","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch H, Peypouquet J (2016) The Rate of Convergence of Nesterov\u2019s Accelerated Forward-Backward Method is Actually Faster Than $$1\/k^2$$. SIAM J Optim 26:1824\u20131834","journal-title":"SIAM J Optim"},{"key":"2922_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-018-1252-x","volume":"174","author":"H Attouch","year":"2019","unstructured":"Attouch H, Peypouquet J (2019) Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators. Math Program 174:391\u2013432","journal-title":"Math Program"},{"key":"2922_CR6","doi-asserted-by":"publisher","first-page":"5734","DOI":"10.1016\/j.jde.2016.08.020","volume":"261","author":"H Attouch","year":"2016","unstructured":"Attouch H, Peypouquet J, Redonta P (2016) Fast convex optimization via inertial dynamics with Hessian driven damping. J Differ Equ 261:5734\u20135783","journal-title":"J Differ Equ"},{"key":"2922_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","volume":"168","author":"H Attouch","year":"2018","unstructured":"Attouch H, Chbani Z, Peypouquet J et al (2018) Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math Program 168:123\u2013175","journal-title":"Math Program"},{"key":"2922_CR8","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 HH, Combettes PL (2011) Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York"},{"key":"2922_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10898-011-9782-2","volume":"54","author":"A Bnouhachem","year":"2012","unstructured":"Bnouhachem A, Noor MA et al (2012) On descent-projection method for solving the split feasibility problems. J Glob Optim 54:627\u2013639","journal-title":"J Glob Optim"},{"key":"2922_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","volume":"18","author":"C Byrne","year":"2002","unstructured":"Byrne C (2002) Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Prob 18:441\u2013453","journal-title":"Inverse Prob"},{"key":"2922_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"C Byrne","year":"2004","unstructured":"Byrne C (2004) A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Prob 20:103\u2013120","journal-title":"Inverse Prob"},{"key":"2922_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor Y, Elfving T (1994) A multiprojection algorithm using Bregman projection in a product space. Numer Algorithms 8:221\u2013239","journal-title":"Numer Algorithms"},{"key":"2922_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10898-020-00899-8","volume":"78","author":"C Chen","year":"2020","unstructured":"Chen C, Pong TK, Tan L et al (2020) A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection. J Glob Optim 78:107\u2013136","journal-title":"J Glob Optim"},{"key":"2922_CR14","doi-asserted-by":"publisher","unstructured":"Dang, Y. Z., Ang, M., Sun, J.: An inertial triple-projection algorithm for solving the split feasibility problem. J. Ind. Manag. Optim (2022) https:\/\/doi.org\/10.3934\/jimo.2022019.","DOI":"10.3934\/jimo.2022019."},{"key":"2922_CR15","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1007\/s11590-013-0619-4","volume":"8","author":"QL Dong","year":"2014","unstructured":"Dong QL, Yao Y, He S (2014) Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces. Optim Lett 8:1031\u20131046","journal-title":"Optim Lett"},{"key":"2922_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10898-018-0628-z","volume":"71","author":"QL Dong","year":"2018","unstructured":"Dong QL, Tang YC, Cho YJ, Rassias ThM (2018) \u2019 \u2019Optimal\u201c choice of the step length of the projection and contraction methods for solving the split feasibility problem. J Global Optim 71:341\u2013360","journal-title":"J Global Optim"},{"key":"2922_CR17","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10898-020-00963-3","volume":"79","author":"QL Dong","year":"2021","unstructured":"Dong QL, He S, Rassias MT (2021) General splitting methods with linearization for the split feasibility problem. J Glob Optim 79:813\u2013836. https:\/\/doi.org\/10.1007\/s10898-020-00963-3","journal-title":"J Glob Optim"},{"key":"2922_CR18","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s11590-017-1148-3","volume":"12","author":"A Gibali","year":"2018","unstructured":"Gibali A, Liu LW, Tang YC (2018) Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim Lett 12:817\u2013830","journal-title":"Optim Lett"},{"key":"2922_CR19","doi-asserted-by":"publisher","first-page":"963","DOI":"10.3934\/jimo.2018080","volume":"15","author":"A Gibali","year":"2019","unstructured":"Gibali A, Mai DT, Vinh NT (2019) A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications. J Ind Manag Optim 15:963\u2013984","journal-title":"J Ind Manag Optim"},{"key":"2922_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10915-015-0078-4","volume":"67","author":"H He","year":"2016","unstructured":"He H, Ling C, Xu HK (2016) An Implementable Splitting Algorithm for the 1-norm Regularized Split Feasibility Problem. J Sci Comput 67:281\u2013298","journal-title":"J Sci Comput"},{"key":"2922_CR21","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/s11075-019-00790-y","volume":"84","author":"S Kesornprom","year":"2020","unstructured":"Kesornprom S, Pholasa N, Cholamjiak P (2020) On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem. Numer Algorithms 84:997\u20131017","journal-title":"Numer Algorithms"},{"key":"2922_CR22","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, G., Martin, V., Wang, F., Xu, H. K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Problems 28, (2012)","DOI":"10.1088\/0266-5611\/28\/8\/085004"},{"key":"2922_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-021-01585-y","author":"X Ma","year":"2021","unstructured":"Ma X, Liu H (2021) An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces. J Appl Math Comput. https:\/\/doi.org\/10.1007\/s12190-021-01585-y","journal-title":"J Appl Math Comput"},{"key":"2922_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s40314-021-01703-3","volume":"41","author":"X Ma","year":"2022","unstructured":"Ma X, Liu H, Li X (2022) The iterative method for solving the proximal split feasibility problem with an application to LASSO problem. Comp Appl Math 41:5. https:\/\/doi.org\/10.1007\/s40314-021-01703-3","journal-title":"Comp Appl Math"},{"key":"2922_CR25","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1080\/02331934.2018.1486838","volume":"67","author":"P Majee","year":"2018","unstructured":"Majee P, Nahak C (2018) On inertial proximal algorithm for split variational inclusion problems. Optimization 67:1701\u20131716","journal-title":"Optimization"},{"key":"2922_CR26","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov Y (1983) A method for solving the convex programming problem with convergence rate $$O(1\/k^2)$$. Dokl Akad Nauk SSSR 269:543\u2013547","journal-title":"Dokl Akad Nauk SSSR"},{"key":"2922_CR27","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1016\/S0895-7177(00)00199-0","volume":"32","author":"MO Osilike","year":"2000","unstructured":"Osilike MO, Aniagbosor SC (2000) Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings. Math Comput Modell 32:1181\u20131191","journal-title":"Math Comput Modell"},{"key":"2922_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak BT (1964) Some methods of speeding up the convergence of iteration methods. USSR Comput Math Math Phys 4:1\u201317","journal-title":"USSR Comput Math Math Phys"},{"key":"2922_CR29","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10589-016-9884-3","volume":"67","author":"B Qu","year":"2017","unstructured":"Qu B, Wang C, Xiu N (2017) Analysis on Newton projection method for the split feasibility problem. Comput Optim Appl 67:175\u2013199","journal-title":"Comput Optim Appl"},{"key":"2922_CR30","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s10898-020-00964-2","volume":"79","author":"S Reich","year":"2021","unstructured":"Reich S, Tuyen TM, Ha MTN (2021) An optimization approach to solving the split feasibility problem in Hilbert spaces. J Glob Optim 79:837\u2013852. https:\/\/doi.org\/10.1007\/s10898-020-00964-2","journal-title":"J Glob Optim"},{"key":"2922_CR31","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s11075-020-01058-6","volume":"88","author":"S Reich","year":"2021","unstructured":"Reich S, Thong DV, Cholamjiak P et al (2021) Inertial projection-type methods for solving pseudomonotone variational inequality problems in Hilbert space. Numer Algor 88:813\u2013835","journal-title":"Numer Algor"},{"key":"2922_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-020-00999-2","author":"DR Sahu","year":"2020","unstructured":"Sahu DR, Cho YJ, Dong QL, Kashyap MR, Li XH (2020) Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces. Numer Algorithms. https:\/\/doi.org\/10.1007\/s11075-020-00999-2","journal-title":"Numer Algorithms"},{"key":"2922_CR33","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1007\/s11590-020-01603-1","volume":"15","author":"Y Shehu","year":"2021","unstructured":"Shehu Y, Gibali A (2021) New inertial relaxed method for solving split feasibilities. Optim Lett 15:2109\u20132126","journal-title":"Optim Lett"},{"key":"2922_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s13398-020-00979-0","volume":"115","author":"Y Shehu","year":"2021","unstructured":"Shehu Y, Dong QL, Liu LL (2021) Global and linear convergence of alternated inertial methods for split feasibility problems. RACSAM 115:53","journal-title":"RACSAM"},{"key":"2922_CR35","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.3934\/jimo.2018023","volume":"23","author":"S Suantai","year":"2018","unstructured":"Suantai S, Pholasa N, Cholamjiak P (2018) The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J Ind Manag Optim 23:1595\u20131615","journal-title":"J Ind Manag Optim"},{"key":"2922_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01798-x","author":"S Suantai","year":"2021","unstructured":"Suantai S, Panyanak B, Kesornprom S et al (2021) Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-021-01798-x","journal-title":"Optim Lett"},{"key":"2922_CR37","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the Lasso. J R Stat Soc Ser B 58:267\u2013288","journal-title":"J R Stat Soc Ser B"},{"key":"2922_CR38","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/s10957-019-01563-2","volume":"183","author":"J Wang","year":"2019","unstructured":"Wang J, Hu Y, Yu CKW et al (2019) A Family of Projection Gradient Methods for Solving the Multiple-Sets Split Feasibility Problem. J Optim Theory Appl 183:520\u2013534","journal-title":"J Optim Theory Appl"},{"key":"2922_CR39","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/26\/10\/105018","volume":"26","author":"HK Xu","year":"2010","unstructured":"Xu HK (2010) Iterative methods for solving the split feasibility in infinite-dimensional Hilbert spaces. Inverse Prob 26:105018","journal-title":"Inverse Prob"},{"key":"2922_CR40","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10589-018-0025-z","volume":"71","author":"J Xu","year":"2018","unstructured":"Xu J, Chi EC, Yang M et al (2018) A majorization-minimization algorithm for split feasibility problems. Comput Optim Appl 71:795\u2013828","journal-title":"Comput Optim Appl"},{"key":"2922_CR41","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jmaa.2004.07.048","volume":"302","author":"Q Yang","year":"2005","unstructured":"Yang Q (2005) On variable-step relaxed projection algorithm for variational inequalities. J Math Anal Appl 302:166\u2013179","journal-title":"J Math Anal Appl"},{"key":"2922_CR42","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10898-018-00735-0","volume":"73","author":"LH Yen","year":"2019","unstructured":"Yen LH, Huyen NTT, Muu LD (2019) A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models. J Glob Optim 73:849\u2013868","journal-title":"J Glob Optim"},{"key":"2922_CR43","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1080\/02331934.2018.1485677","volume":"67","author":"H Yu","year":"2018","unstructured":"Yu H, Zhan WR, Wang FH (2018) The ball-relaxed CQ algorithms for the split feasibility problem. Optimization 67:1687\u20131699","journal-title":"Optimization"},{"key":"2922_CR44","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/11\/115001","volume":"25","author":"WX Zhang","year":"2009","unstructured":"Zhang WX, Han DR, Li ZB (2009) A self-adaptive projection method for solving the multiple-sets split feasibility problem. Inverse Prob 25:115001","journal-title":"Inverse Prob"},{"key":"2922_CR45","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/3\/035009","volume":"27","author":"JL Zhao","year":"2011","unstructured":"Zhao JL, Yang QZ (2011) Self-adaptive projection methods for the multiple-sets split feasibility problem. Inverse Prob 27:035009","journal-title":"Inverse Prob"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02922-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02922-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02922-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T09:05:51Z","timestamp":1730106351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02922-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,6]]},"references-count":45,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2922"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02922-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,6]]},"assertion":[{"value":"13 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"There are no Conflict of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"431"}}