{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T06:58:24Z","timestamp":1772607504930,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s40314-026-03679-4","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:03:56Z","timestamp":1772600636000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Preconditioning splitting methods for the split feasibility problem"],"prefix":"10.1007","volume":"45","author":[{"given":"Wenkai","family":"Guo","sequence":"first","affiliation":[]},{"given":"Linlin","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Luoyi","family":"Shi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8634-7221","authenticated-orcid":false,"given":"Yasong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,4]]},"reference":[{"issue":"12","key":"3679_CR1","doi-asserted-by":"publisher","first-page":"2482","DOI":"10.1080\/00207160.2022.2068146","volume":"99","author":"E Altiparmak","year":"2022","unstructured":"Altiparmak E, Karahan I (2022) A new preconditioning algorithm for finding a zero of the sum of two monotone operators and its application to image restoration problems. Int J Comput Math 99(12):2482\u20132498. https:\/\/doi.org\/10.1080\/00207160.2022.2068146","journal-title":"Int J Comput Math"},{"key":"3679_CR2","doi-asserted-by":"publisher","unstructured":"Alt\u0131parmak E, Jolaoso LO, Karahan I, Rehman H ur (2024) Pre-conditioning CQ algorithm for solving the split feasibility problem and its application to image restoration problem. Optimization 74(13):3123\u20133141. https:\/\/doi.org\/10.1080\/02331934.2024.2358412","DOI":"10.1080\/02331934.2024.2358412"},{"key":"3679_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BFb0120965","volume":"17","author":"PD Bertsekas","year":"1982","unstructured":"Bertsekas PD, Gafni EM (1982) Projection methods for variational inequities with application to the traffic assignment problem. Math Program Stud 17:139\u2013159","journal-title":"Math Program Stud"},{"key":"3679_CR4","first-page":"472","volume":"256","author":"RI Bot","year":"2015","unstructured":"Bot RI, Csetnek ER, Hendrich C (2015) Inertial Douglas\u2013Rachford splitting for monotone inclusion problems. Appl Math Comput 256:472\u2013487","journal-title":"Appl Math Comput"},{"key":"3679_CR5","first-page":"87","volume-title":"Inherently parallel algorithms in feasibility and optimization and their applications","author":"CL Byrne","year":"2001","unstructured":"Byrne CL (2001) Bregman\u2013Legendre multidistances projection algorithm for convex feasibility and optimization. In: Butnariu D, Censor Y, Reich S (eds) Inherently parallel algorithms in feasibility and optimization and their applications. Elsevier, Amsterdam, pp 87\u2013100"},{"key":"3679_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"CL Byrne","year":"2004","unstructured":"Byrne CL (2004) A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl 20:103\u2013120","journal-title":"Inverse Probl"},{"key":"3679_CR7","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 projections in a product space. Numer Algorithms 8:221\u2013239","journal-title":"Numer Algorithms"},{"key":"3679_CR8","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.3934\/jimo.2016078","volume":"13","author":"Y Dang","year":"2016","unstructured":"Dang Y, Sun J, Xu H (2016) Inertial accelerated algorithms for solving a split feasibility problem. J Ind Manag Optim 13:1383\u20131394","journal-title":"J Ind Manag Optim"},{"issue":"9","key":"3679_CR9","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1080\/02331934.2014.895897","volume":"64","author":"QL Dong","year":"2014","unstructured":"Dong QL, He S, Zhao J (2014) Solving the split equality problem without prior knowledge of operator norms. Optimization 64(9):1887\u20131906","journal-title":"Optimization"},{"key":"3679_CR10","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 et al (2018) \u201cOptimal\u2019\u2019 choice of the step length of the projection and contraction methods for solving the split feasibility problem. J Glob Optim 71:341\u2013360","journal-title":"J Glob Optim"},{"key":"3679_CR11","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","journal-title":"J Glob Optim"},{"issue":"10","key":"3679_CR12","doi-asserted-by":"publisher","first-page":"2585","DOI":"10.1080\/02331934.2022.2069567","volume":"72","author":"QL Dong","year":"2022","unstructured":"Dong QL, Liu L, Qin X, Yao JC (2022) An alternated inertial general splitting method with linearization for the split feasibility problem. Optimization 72(10):2585\u20132607","journal-title":"Optimization"},{"key":"3679_CR13","volume-title":"Finite-dimensional variational inequality and complementarity problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei F, Pang JS (2003a) Finite-dimensional variational inequality and complementarity problems, vol I. Springer, New York"},{"key":"3679_CR14","volume-title":"Finite-dimensional variational inequality and complementarity problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei F, Pang JS (2003b) Finite-dimensional variational inequality and complementarity problems, vol II. Springer, New York"},{"key":"3679_CR15","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 L, Tang Y (2018) Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim Lett 12:817\u2013830","journal-title":"Optim Lett"},{"key":"3679_CR16","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s10957-018-1226-4","volume":"176","author":"F Iutzeler","year":"2018","unstructured":"Iutzeler F, Malick J (2018) On the proximal gradient algorithm with alternated inertia. J Optim Theory Appl 176:688\u2013710","journal-title":"J Optim Theory Appl"},{"issue":"10","key":"3679_CR17","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.2298\/FIL2110241K","volume":"35","author":"S Kesornprom","year":"2021","unstructured":"Kesornprom S, Pholasa N, Cholamjiak P (2021) Efficient projective methods for the split feasibility problem and its applications to compressed sensing and image debluring. Filomat 35(10):3241\u20133266. https:\/\/doi.org\/10.2298\/FIL2110241K","journal-title":"Filomat"},{"key":"3679_CR18","doi-asserted-by":"crossref","unstructured":"L\u00f3pez G, Mart\u00edn-M\u00e1rquez V, Wang F, Xu H (2012) Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl 28:085004","DOI":"10.1088\/0266-5611\/28\/8\/085004"},{"key":"3679_CR19","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1007\/s11590-013-0708-4","volume":"8","author":"A Moudafi","year":"2014","unstructured":"Moudafi A, Thakur BS (2014) Solving proximal split feasibility problems without prior knowledge of operator norms. Optim Lett 8:2099\u20132110","journal-title":"Optim Lett"},{"key":"3679_CR20","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1088\/0266-5611\/21\/5\/009","volume":"21","author":"B Qu","year":"2005","unstructured":"Qu B, Xiu N (2005) A note on the CQ algorithm for the split feasibility problem. Inverse Probl 21:1655\u20131665","journal-title":"Inverse Probl"},{"key":"3679_CR21","doi-asserted-by":"publisher","DOI":"10.1186\/s13660-015-0936-5","author":"M Rahaman","year":"2015","unstructured":"Rahaman M, Liou YC, Ahmad R et al (2015) Convergence theorems for split equality generalized mixed equilibrium problems for demi-contractive mappings. J Inequal Appl. https:\/\/doi.org\/10.1186\/s13660-015-0936-5","journal-title":"J Inequal Appl"},{"key":"3679_CR22","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s11075-020-00999-2","volume":"87","author":"D Sahu","year":"2021","unstructured":"Sahu D, Cho Y, Dong Q et al (2021) Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces. Numer Algorithms 87:1075\u20131095. https:\/\/doi.org\/10.1007\/s11075-020-00999-2","journal-title":"Numer Algorithms"},{"key":"3679_CR23","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. https:\/\/doi.org\/10.1007\/s11590-020-01603-1","journal-title":"Optim Lett"},{"key":"3679_CR24","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":"3679_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13398-020-00944-x","volume":"115","author":"HM Srivastava","year":"2021","unstructured":"Srivastava HM, Chung KJ, Liao JJ et al (2021) An accurate and reliable mathematical analytic solution procedure for the EOQ model with non-instantaneous receipt under supplier credits. RACSAM 115:1. https:\/\/doi.org\/10.1007\/s13398-020-00944-x","journal-title":"RACSAM"},{"key":"3679_CR26","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1007\/s13398-018-0535-7","volume":"113","author":"S Suantai","year":"2018","unstructured":"Suantai S, Pholasa N, Cholamjiak P (2018) Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems. Revista de la Real Academia de Ciencias Exactas F\u00edsicas y Naturales Serie A Matem\u00e1ticas 113:1081\u20131099","journal-title":"Revista de la Real Academia de Ciencias Exactas F\u00edsicas y Naturales Serie A Matem\u00e1ticas"},{"key":"3679_CR27","doi-asserted-by":"crossref","unstructured":"Tibshirani R (1996) Regression shrinkage and selection via the lasso. J R Stat Soc Ser B 58(1)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"3679_CR28","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s11784-018-0583-9","volume":"20","author":"S Vong","year":"2018","unstructured":"Vong S, Liu D (2018) An inertial Mann algorithm for nonexpansive mappings. J fixed point theory appl 20:102. https:\/\/doi.org\/10.1007\/s11784-018-0583-9","journal-title":"J fixed point theory appl"},{"key":"3679_CR29","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10898-024-01399-9","volume":"90","author":"S Vong","year":"2024","unstructured":"Vong S, Yao Z (2024) Modified general splitting method for the split feasibility problem. J Glob Optim 90:711\u2013726. https:\/\/doi.org\/10.1007\/s10898-024-01399-9","journal-title":"J Glob Optim"},{"key":"3679_CR30","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s11075-017-0347-4","volume":"77","author":"F Wang","year":"2018","unstructured":"Wang F (2018) Polyak\u2019s gradient method for split feasibility problem constrained by level sets. Numer Algorithms 77:925\u2013938","journal-title":"Numer Algorithms"},{"key":"3679_CR31","first-page":"1","volume":"2010","author":"F Wang","year":"2010","unstructured":"Wang F, Xu H (2010) Approximating curve and strong convergence of the CQ algorithm for the split feasibility problem. J Inequal Appl 2010:1\u201313","journal-title":"J Inequal Appl"},{"issue":"5\u20136","key":"3679_CR32","first-page":"1101","volume":"70","author":"F Wang","year":"2020","unstructured":"Wang F, Yu H (2020) An inertial relaxed CQ algorithm with an application to the LASSO and elastic net. Optimization 70(5\u20136):1101\u20131119","journal-title":"Optimization"},{"key":"3679_CR33","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1186\/1029-242X-2014-163","volume":"2014","author":"P Wang","year":"2014","unstructured":"Wang P, Zhou H (2014) A preconditioning method of the CQ algorithm for solving an extended split feasibility problem. J Inequal Appl 2014:163. https:\/\/doi.org\/10.1186\/1029-242X-2014-163","journal-title":"J Inequal Appl"},{"key":"3679_CR34","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":"3679_CR35","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10589-011-9429-8","volume":"52","author":"W Zhang","year":"2012","unstructured":"Zhang W, Han D, Yuan X (2012) An efficient simultaneous method for the constrained multiple-sets split feasibility problem. Comput Optim Appl 52:825\u2013843","journal-title":"Comput Optim Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03679-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03679-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03679-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:03:59Z","timestamp":1772600639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03679-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,4]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3679"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03679-4","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,4]]},"assertion":[{"value":"29 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"280"}}