{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:50Z","timestamp":1740142490710,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T00:00:00Z","timestamp":1615507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T00:00:00Z","timestamp":1615507200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301379","11226125"],"award-info":[{"award-number":["11301379","11226125"]}],"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":[[2021,4]]},"DOI":"10.1007\/s40314-021-01465-y","type":"journal-article","created":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:02:55Z","timestamp":1615582975000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-step methods and relaxed two-step methods for solving the split equality problem"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2037-9225","authenticated-orcid":false,"given":"Dianlu","family":"Tian","sequence":"first","affiliation":[]},{"given":"Lining","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,12]]},"reference":[{"key":"1465_CR1","first-page":"1164","volume":"12","author":"AS Antipin","year":"1976","unstructured":"Antipin AS (1976) On a method for convex programs using a symmetrical modification of the Lagrange function. \u00c8konom. i Mat. Metody 12:1164\u20131173","journal-title":"\u00c8konom. i Mat. Metody"},{"key":"1465_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke HH, Borwein JM (1996) On projection algorithms for solving convex feasibility problems. SIAM Rev 38:367\u2013426","journal-title":"SIAM Rev"},{"key":"1465_CR3","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 Probl 18:441\u2013453","journal-title":"Inverse Probl"},{"key":"1465_CR4","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10589-013-9599-7","volume":"57","author":"X Cai","year":"2014","unstructured":"Cai X, Gu G, He BS (2014) On the $$O(1\/t)$$ convergence rate of the projection and contaction methods for variational inequalities with Lipschitz continuous monotone operators. Comput Optim Appl 57:339\u2013363","journal-title":"Comput Optim Appl"},{"issue":"2\u20134","key":"1465_CR5","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(2\u20134):221\u2013239","journal-title":"Numer. Algorithms"},{"key":"1465_CR6","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10957-010-9757-3","volume":"148","author":"Y Censor","year":"2011","unstructured":"Censor Y, Gibali A, Reich S (2011) The subgradient extragradient method for solving variational inequalities in Hilbert space. J Optim Theory Appl 148:318\u2013335","journal-title":"J Optim Theory Appl"},{"key":"1465_CR7","first-page":"1965","volume":"16","author":"LC Ceng","year":"2015","unstructured":"Ceng LC, Wong NC, Yao JC (2015) Hybrid extragradient methods for finding minimum-norm solutions of split feasibility problems. J Nonlinear Convex Anal 16:1965\u20131983","journal-title":"J Nonlinear Convex Anal"},{"key":"1465_CR8","volume-title":"Byrne, abdellatif moudafi, extensions of the CQ algorithm for the split feasibility and split equality problems, documents de Travail 2013\u201301","author":"L Charles","year":"2013","unstructured":"Charles L (2013) Byrne, abdellatif moudafi, extensions of the CQ algorithm for the split feasibility and split equality problems, documents de Travail 2013\u201301. Universit des Antilles et de la Guyane, CEREGMIA"},{"key":"1465_CR9","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1080\/02331934.2016.1239266","volume":"65","author":"QL Dong","year":"2016","unstructured":"Dong QL, Lu YY, Yang J (2016) The extragradient algorithm with inertial effects for solving the variational inequality. Optim 65:2217\u20132226","journal-title":"Optim"},{"key":"1465_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/BF01589441","volume":"35","author":"M Fukushima","year":"1986","unstructured":"Fukushima M (1986) A relaxed projection method for variational inequalities. Math Program 35:58\u201370","journal-title":"Math Program"},{"key":"1465_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002459900037","volume":"35","author":"BS He","year":"1997","unstructured":"He BS (1997) A class of projection and contraction methods for monotone variational inequalities. Appl Math Optim 35:69\u201376","journal-title":"Appl Math Optim"},{"key":"1465_CR12","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich GM (1976) The extragradient method for finding saddle points and other problems. \u00c8konom. i Mat. Metody 12:747\u2013756","journal-title":"\u00c8konom. i Mat. Metody"},{"key":"1465_CR13","doi-asserted-by":"crossref","unstructured":"Shi LY, Chen RD, Wu YJ (2014) Strong convergence of iterative algorithms for the split equality problem. J Inequal Appl (Article ID 478)","DOI":"10.1186\/1029-242X-2014-478"},{"key":"1465_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02192286","volume":"91","author":"DF Sun","year":"1996","unstructured":"Sun DF (1996) A class of iterative methods for solving nonlinear projection equations. J Optim Theory Appl 91:123\u2013140","journal-title":"J Optim Theory Appl"},{"key":"1465_CR15","first-page":"1349","volume":"15","author":"W Takahashi","year":"2014","unstructured":"Takahashi W (2014) The split feasibility problem in Banach spaces. J Nonlinear Convex Anal 15:1349\u20131355","journal-title":"J Nonlinear Convex Anal"},{"key":"1465_CR16","doi-asserted-by":"crossref","unstructured":"Tian DL, Shi LY, Chen RD (2016) Iterative algorithm for solving the multiple-sets split equality problem with split self-adaptive step size in Hilbert spaces. J Inequal Appl 2016(Article ID 34)","DOI":"10.1186\/s13660-016-0982-7"},{"key":"1465_CR17","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1007\/s11784-017-0422-4","volume":"19","author":"DL Tian","year":"2017","unstructured":"Tian DL, Shi LY, Chen RD (2017) Strong convergence theorems for split inclusion problems in Hilbert spaces. J Fixed Point Theory Appl 19:1501\u20131514","journal-title":"J Fixed Point Theory Appl"},{"key":"1465_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng P (2000) A modified forward-backward splitting method for maximal monotone mappings. SIAM J Control Optim 38:431\u2013446","journal-title":"SIAM J Control Optim"},{"key":"1465_CR19","doi-asserted-by":"publisher","first-page":"4105","DOI":"10.1016\/j.na.2011.03.044","volume":"74","author":"F Wang","year":"2011","unstructured":"Wang F, Xu HK (2011) Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Amal 74:4105\u20134111","journal-title":"Nonlinear Amal"},{"key":"1465_CR20","first-page":"1891","volume":"18","author":"HK Xu","year":"2017","unstructured":"Xu HK, Alghamdi MA, Shahzad N (2017) An unconstrained optimization approach to the split feasibility problem. J Nonlinear Convex Anal 18:1891\u20131899","journal-title":"J Nonlinear Convex Anal"},{"issue":"3","key":"1465_CR21","first-page":"37","volume":"80","author":"YH Yao","year":"2018","unstructured":"Yao YH, Postolache M, Qin XL (2018) Iterative algorithms for the proximal split feasibility problem. U Politeh Buch Ser A 80(3):37\u201344","journal-title":"U Politeh Buch Ser A"},{"key":"1465_CR22","doi-asserted-by":"publisher","first-page":"035009","DOI":"10.1088\/0266-5611\/27\/3\/035009","volume":"27","author":"JL Zhao","year":"2011","unstructured":"Zhao JL, Yang Q (2011) Self-adaptive projection methods for the multiple-sets split feasibility problem. Inverse Probl 27:035009","journal-title":"Inverse Probl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01465-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-021-01465-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01465-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T22:40:17Z","timestamp":1617921617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-021-01465-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1465"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01465-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2021,3,12]]},"assertion":[{"value":"29 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2021","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"83"}}