{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:39:54Z","timestamp":1772908794806,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:00:00Z","timestamp":1684368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:00:00Z","timestamp":1684368000000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12190-023-01875-7","type":"journal-article","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T22:01:34Z","timestamp":1684447294000},"page":"3067-3094","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications"],"prefix":"10.1007","volume":"69","author":[{"given":"Tong","family":"Ling","sequence":"first","affiliation":[]},{"given":"Xiaolei","family":"Tong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6922-7850","authenticated-orcid":false,"given":"Luoyi","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,18]]},"reference":[{"key":"1875_CR1","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, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"issue":"2","key":"1875_CR2","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.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Probl. 18(2), 441\u2013453 (2002)","journal-title":"Inverse Probl."},{"issue":"1","key":"1875_CR3","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.: A unified treatment for some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20(1), 103\u2013120 (2004)","journal-title":"Inverse Probl."},{"issue":"10","key":"1875_CR4","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1088\/0031-9155\/51\/10\/001","volume":"51","author":"Y Censor","year":"2006","unstructured":"Censor, Y., Bortfeld, T., Martin, B., Trofimov, A.: A unified approach for inversion problems in intensity modulated radiation therapy. Phys. Med. Biol. 51(10), 2353\u20132365 (2006)","journal-title":"Phys. Med. Biol."},{"issue":"2\u20134","key":"1875_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8(2\u20134), 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"issue":"6","key":"1875_CR6","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1088\/0266-5611\/21\/6\/017","volume":"21","author":"Y Censor","year":"2005","unstructured":"Censor, Y., Elfving, T., Kopf, N., Bortfeld, T.: The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21(6), 2071\u20132084 (2005)","journal-title":"Inverse Probl."},{"issue":"3","key":"1875_CR7","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.3934\/jimo.2016078","volume":"13","author":"Y Dang","year":"2017","unstructured":"Dang, Y., Sun, J., Xu, H.: Inertial accelerated algorithms for solving a split feasibility problem. J. Ind. Manag. Optim. 13(3), 1383\u20131394 (2017)","journal-title":"J. Ind. Manag. Optim."},{"issue":"4","key":"1875_CR8","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.3934\/jimo.2018135","volume":"15","author":"Y Dang","year":"2019","unstructured":"Dang, Y., Sun, J., Zhang, S.: Double projection algorithms for solving the split feasibility problems. J. Ind. Manag. Optim. 15(4), 2023\u20132034 (2019)","journal-title":"J. Ind. Manag. Optim."},{"key":"1875_CR9","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10898-020-00963-3","volume":"79","author":"QL Dong","year":"2021","unstructured":"Dong, Q.L., He, S., Rassias, M.T.: General splitting methods with linearization for the split feasibility problem. J. Glob. Optim. 79, 813\u2013836 (2021)","journal-title":"J. Glob. Optim."},{"key":"1875_CR10","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.-W., Tang, Y.-C.: Note on the modified relaxation CQ algorithm for the split feasibility problem. Optim. Lett. 12, 817\u2013830 (2018)","journal-title":"Optim. Lett."},{"issue":"2","key":"1875_CR11","doi-asserted-by":"publisher","first-page":"963","DOI":"10.3934\/jimo.2018080","volume":"15","author":"A Gibali","year":"2019","unstructured":"Gibali, A., Mai, D.T., Vinh, N.T.: A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications. J. Ind. Manag. Optim. 15(2), 963\u2013984 (2019)","journal-title":"J. Ind. Manag. Optim."},{"key":"1875_CR12","doi-asserted-by":"crossref","unstructured":"He, S., Yang, C.: Solving the variational inequality problem defined on intersection of finite level sets. Abstr. Appl. Anal. 2013, Article ID 942315 (2013)","DOI":"10.1155\/2013\/942315"},{"issue":"12","key":"1875_CR13","doi-asserted-by":"publisher","first-page":"4343","DOI":"10.1002\/mma.5654","volume":"42","author":"Z Jouymandi","year":"2019","unstructured":"Jouymandi, Z., Moradlou, F.: Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces. Math. Methods Appl. Sci. 42(12), 4343\u20134359 (2019)","journal-title":"Math. Methods Appl. Sci."},{"key":"1875_CR14","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.: On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem. Numer. Algorithms 84, 997\u20131017 (2020)","journal-title":"Numer. Algorithms"},{"key":"1875_CR15","first-page":"1","volume":"2021","author":"H Li","year":"2021","unstructured":"Li, H., Wu, Y., Wang, F.: New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces. J. Math. 2021, 1\u201313 (2021)","journal-title":"J. Math."},{"issue":"8","key":"1875_CR16","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/28\/8\/085004","volume":"28","author":"G L\u00f3pez","year":"2012","unstructured":"L\u00f3pez, G., Mart\u00edn-M\u00e1rquez, V., Wang, F., Xu, H.K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl. 28(8), 085004 (2012)","journal-title":"Inverse Probl."},{"key":"1875_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13398-020-00979-0","volume":"115","author":"Y Shehu","year":"2021","unstructured":"Shehu, Y., Dong, Q.L., Liu, L.: Global and linear convergence of alternated inertial methods for split feasibility problems. RACSAM 115, 1\u201326 (2021)","journal-title":"RACSAM"},{"issue":"6","key":"1875_CR18","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.: New inertial relaxed method for solving split feasibilities. Optim. Lett. 15(6), 2109\u20132126 (2021)","journal-title":"Optim. Lett."},{"issue":"6","key":"1875_CR19","doi-asserted-by":"publisher","first-page":"933","DOI":"10.3390\/math10060933","volume":"10","author":"S Suantai","year":"2022","unstructured":"Suantai, S., Kesornprom, S., Cholamjiak, W., Cholamjiak, P.: Modified projection method with inertial technique and hybrid stepsize for the split feasibility problem. Mathematics 10(6), 933\u2013944 (2022)","journal-title":"Mathematics"},{"issue":"4","key":"1875_CR20","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.3934\/jimo.2018023","volume":"14","author":"S Suantai","year":"2018","unstructured":"Suantai, S., Pholasa, N., Cholamjiak, P.: The modified inertial relaxed CQ algorithm for solving the split feasibility problems. J. Ind. Manag. Optim. 14(4), 1595\u20131615 (2018)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"1875_CR21","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s11075-017-0347-4","volume":"77","author":"F Wang","year":"2018","unstructured":"Wang, F.: Polyak\u2019s gradient method for split feasibility problem constrained by level sets. Numer. Algorithms 77(3), 925\u2013938 (2018)","journal-title":"Numer. Algorithms"},{"key":"1875_CR22","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/102085","volume":"2010","author":"F Wang","year":"2010","unstructured":"Wang, F., Xu, H.K.: Approximating curve and strong convergence of the CQ algorithm for the split feasibility problem. J. Inequal. Appl. 2010, 102085 (2010)","journal-title":"J. Inequal. Appl."},{"issue":"10","key":"1875_CR23","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/26\/10\/105018","volume":"26","author":"HK Xu","year":"2010","unstructured":"Xu, H.K.: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 26(10), 105018 (2010)","journal-title":"Inverse Probl."},{"issue":"4","key":"1875_CR24","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1088\/0266-5611\/20\/4\/014","volume":"20","author":"Q Yang","year":"2004","unstructured":"Yang, Q.: The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 20(4), 1261\u20131266 (2004)","journal-title":"Inverse Probl."},{"key":"1875_CR25","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s11590-011-0340-0","volume":"6","author":"X Yu","year":"2012","unstructured":"Yu, X., Shahzad, N., Yao, Y.: Implicit and explicit algorithms for solving the split feasibility problem. Optim. Lett. 6, 1447\u20131462 (2012)","journal-title":"Optim. Lett."},{"key":"1875_CR26","doi-asserted-by":"crossref","unstructured":"Yu, H., Wang, F.: A new relaxed method for the split feasibility problem in Hilbert spaces. Optimization 1\u201316 (2022)","DOI":"10.1080\/02331934.2022.2158036"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01875-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01875-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01875-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T19:24:03Z","timestamp":1689794643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01875-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,18]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1875"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01875-7","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,18]]},"assertion":[{"value":"13 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2023","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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}