{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T08:50:16Z","timestamp":1781686216833,"version":"3.54.5"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T00:00:00Z","timestamp":1599868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T00:00:00Z","timestamp":1599868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Open Fund of Tianjin Key Lab for Advanced Signal Processing","award":["No. 2019ASP-TJ03"],"award-info":[{"award-number":["No. 2019ASP-TJ03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11075-020-00999-2","type":"journal-article","created":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T20:03:54Z","timestamp":1599941034000},"page":"1075-1095","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces"],"prefix":"10.1007","volume":"87","author":[{"given":"D.R.","family":"Sahu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.J.","family":"Cho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6765-4437","authenticated-orcid":false,"given":"Q.L.","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.R.","family":"Kashyap","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"X.H.","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,12]]},"reference":[{"key":"999_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, R.P., Regan, D.O, Sahu, D.R.: Fixed Point Theory for Lipschitzian-Type Mappings with Applications, Topological Fixed Point Theory and Its Applications. Springer, New York USA (2009)"},{"key":"999_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 9, 3\u201311 (2001)","journal-title":"Set-Valued Anal."},{"key":"999_CR3","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s11784-018-0620-8","volume":"20","author":"PK Anh","year":"2018","unstructured":"Anh, P.K., Vinh, N.T., Dung, V.T.: A new self-adaptive CQ algorithm with an application to the lasso problem. J. Fixed Point Theory Appl. 20, 142 (2018)","journal-title":"J. Fixed Point Theory Appl."},{"key":"999_CR4","doi-asserted-by":"crossref","unstructured":"Ansari, Q.H., Rehan, A.: Split feasibility and xed point problems. In: Ansari, Q.H. (ed.) Nonlinear Analysis Approximation Theorem Optimization Application, pp 281\u2013322. Springer (2014)","DOI":"10.1007\/978-81-322-1883-8_9"},{"key":"999_CR5","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, New York (2011)"},{"key":"999_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"999_CR7","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, 441\u2013453 (2002)","journal-title":"Inverse Probl."},{"key":"999_CR8","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 projection in a product space. Numer. Algorithms 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"key":"999_CR9","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, 2071\u201384 (2005)","journal-title":"Inverse Probl."},{"key":"999_CR10","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.3934\/jimo.2016078","volume":"13","author":"Y Dang","year":"2017","unstructured":"Dang, Y., Sun, J., Xu, H.: Inertial accelerated algorithm for solving a split feasibility problem. J. Ind. Manag. Optim. 13, 1383\u20131394 (2017)","journal-title":"J. Ind. Manag. Optim."},{"key":"999_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1186\/s13660-019-2030-x","volume":"2019","author":"QL Dong","year":"2019","unstructured":"Dong, Q.L., Li, X.H., Kitkuan, D., Cho, Y.J., Kumam, P.: Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization. J. Inequal. Appl. 2019, 77 (2019)","journal-title":"J. Inequal. Appl."},{"key":"999_CR12","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10898-018-0727-x","volume":"73","author":"QL Dong","year":"2019","unstructured":"Dong, Q.L., Huang, J., Li, X.H., Cho, Y.J., Rassias, Th.M.: MiKM: Multi-step inertial ktrsnosel\u2019ski\u00ed-mann algorithm and its applications. J. Global Optim. 73, 801\u2013824 (2019)","journal-title":"J. Global Optim."},{"key":"999_CR13","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1007\/s11590-013-0619-4","volume":"8","author":"QL Dong","year":"2014","unstructured":"Dong, Q.L., Yao, Y., He, S.: Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in hilbert spaces. Optim. Lett. 8, 1031\u20131046 (2014)","journal-title":"Optim. Lett."},{"key":"999_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11590-016-1102-9","volume":"12","author":"QL Dong","year":"2018","unstructured":"Dong, Q.L., Yuan, H.B., Cho, Y.J., Rassias, Th.M.: Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. Optim. Lett. 12, 87\u2013102 (2018)","journal-title":"Optim. Lett."},{"key":"999_CR15","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10898-017-0506-0","volume":"70","author":"QL Dong","year":"2018","unstructured":"Dong, Q.L., Cho, Y.J., Zhong, L.L., Rassias, Th.M.: Inertial projection and contraction algorithms for variational inequalities. J. Global Optim. 70, 687\u2013704 (2018)","journal-title":"J. Global Optim."},{"key":"999_CR16","doi-asserted-by":"crossref","unstructured":"Dong, Q.L., Cho, Y.J., Rassias, Th.M.: General inertial Mann algorithms and their convergence analysis for nonexpansive mappings. In: Rassias, T.H.M. (ed.) Applications of Nonlinear Analysis, pp 175\u2013191. Springer (2018)","DOI":"10.1007\/978-3-319-89815-5_7"},{"key":"999_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10898-018-0628-z","volume":"71","author":"QL Dong","year":"2018","unstructured":"Dong, Q.L., Tang, Y.C., Cho, Y.J., Rassias, Th.M.: \u201cOptimal\u201d choice of the step length of the projection and contraction methods for solving the split feasibility problem. J. Global Optim. 71, 341\u2013360 (2018)","journal-title":"J. Global Optim."},{"key":"999_CR18","doi-asserted-by":"crossref","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, 963\u2013984 (2019)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"999_CR19","doi-asserted-by":"publisher","first-page":"226","DOI":"10.3390\/math7030226","volume":"7","author":"W Jirakitpuwapat","year":"2019","unstructured":"Jirakitpuwapat, W., Kumam, P., Cho, Y.J., Sitthithakerngkiet, K.: A general algorithm for the split common fixed point problem with its applications to signal processing. Mathematics 7(3), 226 (2019)","journal-title":"Mathematics"},{"key":"999_CR20","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. Algor. 84, 997\u20131017 (2020)","journal-title":"Numer. Algor."},{"key":"999_CR21","doi-asserted-by":"crossref","unstructured":"Lopez, G., Martin, V., Wang, F., Xu, H.K.: Solving the split feasibility problem without prior knowledge of matrix norms, Inverse Problem, 28 (2012)","DOI":"10.1088\/0266-5611\/28\/8\/085004"},{"key":"999_CR22","doi-asserted-by":"crossref","unstructured":"Ma, Z., Wang, L., Cho, Y.J.: Some results for split equality equilibrium problems in Banach spaces. Symmetry, 11 (2019)","DOI":"10.3390\/sym11020194"},{"key":"999_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11228-006-0027-3","volume":"15","author":"PE Maing\u00e9","year":"2007","unstructured":"Maing\u00e9, P.E.: Inertial iterative process for fixed points of certain quasi-nonexpansive mapping. Set Valued Anal. 15, 67\u201379 (2007)","journal-title":"Set Valued Anal."},{"key":"999_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. U.S.S.R. Comput. Math. Math. Phys. 4, 1\u201317 (1964)","journal-title":"U.S.S.R. Comput. Math. Math. Phys."},{"key":"999_CR25","doi-asserted-by":"crossref","unstructured":"Qu, B., Liu, B.: The split feasibility problem and its solution algorithm, Math Problems in Engin (2018)","DOI":"10.1155\/2018\/4123168"},{"key":"999_CR26","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"999_CR27","first-page":"187","volume":"12","author":"DR Sahu","year":"2011","unstructured":"Sahu, D.R.: Application of the S-iteration process to constrained minimization problems and split feasibility problems. Fixed Point Theory 12(1), 187\u2013204 (2011)","journal-title":"Fixed Point Theory"},{"key":"999_CR28","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1080\/01630563.2016.1206566","volume":"37","author":"DR Sahu","year":"2016","unstructured":"Sahu, D.R., Ansari, Q.H., Yao, J.C.: Convergence of inexact Mann iterations generated by nearly nonexpansive sequences and applications. Numer. Funct. Anal. Optim. 37, 1312\u20131338 (2016)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"999_CR29","doi-asserted-by":"publisher","unstructured":"Shehu, Y., Gibali, A.: New inertial relaxed method for solving split feasibilities, Optim. Lett. https:\/\/doi.org\/10.1007\/s11590-020-01603-1 (2020)","DOI":"10.1007\/s11590-020-01603-1"},{"key":"999_CR30","doi-asserted-by":"crossref","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. Indust. Manag. Optim. 14, 1595\u20131615 (2018)","journal-title":"J. Indust. Manag. Optim."},{"key":"999_CR31","first-page":"1081","volume":"113","author":"S Suantai","year":"2019","unstructured":"Suantai, S., Pholasa, N., Cholamjiak, P.: Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems. Racsam Rev. R. Acad. A. 113, 1081\u20131099 (2019)","journal-title":"Racsam Rev. R. Acad. A."},{"key":"999_CR32","doi-asserted-by":"publisher","first-page":"789","DOI":"10.3390\/math7090789","volume":"7","author":"S Suantai","year":"2019","unstructured":"Suantai, S., Kesornprom, S., Cholamjiak, P.: A new hybrid CQ algorithm for the split feasibility problem in Hilbert spaces and its applications to compressed sensing. Mathematics 7, 789 (2019)","journal-title":"Mathematics"},{"key":"999_CR33","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1006\/jmaa.1993.1309","volume":"178","author":"KK Tan","year":"1993","unstructured":"Tan, K.K., Xu, H.K.: Approximating fixed point of nonexpansive mappings by the Ishikawa iteration process. J. Math. Anal. Appl. 178, 301\u2013308 (1993)","journal-title":"J. Math. Anal. Appl."},{"key":"999_CR34","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso, J.R. Stat. Soc. Ser B 58, 267\u2013288 (1996)","journal-title":"Stat. Soc. Ser B"},{"key":"999_CR35","doi-asserted-by":"crossref","unstructured":"Vinh, N., Cholamjiak, P., Suantai, S.: A new CQ algorithm for solving split feasibility problems in Hilbert spaces, Bull. Malays. Math. Sci Soc (2018)","DOI":"10.1007\/s40840-018-0614-0"},{"key":"999_CR36","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\u2018s gradient method for split feasibility problem constrained by level sets, Numer. Algorithms 77, 925\u2013938 (2018)","journal-title":"Algorithms"},{"key":"999_CR37","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1215\/20088752-2017-0028","volume":"9","author":"U Witthayarat","year":"2018","unstructured":"Witthayarat, U., Cho, Y.J., Cholamjiak, P.: On solving proximal split feasibility problems and applications. Ann. Funct. Anal. 9, 111\u2013122 (2018)","journal-title":"Ann. Funct. Anal."},{"key":"999_CR38","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.: On variable-step relaxed projection algorithm for variational inequalities. J. Math. Anal. Appl. 302, 166\u2013179 (2005)","journal-title":"J. Math. Anal. Appl."},{"key":"999_CR39","doi-asserted-by":"publisher","first-page":"105018","DOI":"10.1088\/0266-5611\/26\/10\/105018","volume":"26","author":"HK Xu","year":"2010","unstructured":"Xu, H.K.: Iterative methods for solving the split feasibility in infinite-dimensional Hilbert spaces. Inverse Probl. 26, 105018 (2010)","journal-title":"Inverse Probl."},{"key":"999_CR40","first-page":"271","volume":"17","author":"J Zhao","year":"2018","unstructured":"Zhao, J., Liang, Y., Liu, Y., Cho, Y.J.: Split equilibrium problems, variational inequality problems and fixed point problems for multi-valued mappings in Hilbert spaces. Appl. Comput. Math. 17, 271\u2013283 (2018)","journal-title":"Appl. Comput. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00999-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00999-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00999-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T18:39:28Z","timestamp":1723574368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00999-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,12]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["999"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00999-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,12]]},"assertion":[{"value":"10 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}