{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T05:26:52Z","timestamp":1686720412724},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,18]],"date-time":"2014-12-18T00:00:00Z","timestamp":1418860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11075-014-9949-2","type":"journal-article","created":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T19:23:04Z","timestamp":1418757784000},"page":"333-339","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Some remarks on the paper \u201cStrong convergence of a self-adaptive method for the spilt feasibility problem\u201d"],"prefix":"10.1007","volume":"70","author":[{"given":"Haiyun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peiyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,18]]},"reference":[{"key":"9949_CR1","doi-asserted-by":"crossref","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":"9949_CR2","doi-asserted-by":"crossref","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, 2353\u20132365 (2006)","journal-title":"Phys. Med. Biol."},{"key":"9949_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschhe","year":"1996","unstructured":"Bauschhe, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"9949_CR4","doi-asserted-by":"crossref","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 subsets and the split feasibility problem. Inverse Probl. 18, 441\u2013453 (2002)","journal-title":"Inverse Probl."},{"key":"9949_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"C Byrne","year":"2004","unstructured":"Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103\u2013120 (2004)","journal-title":"Inverse Probl."},{"key":"9949_CR6","doi-asserted-by":"crossref","unstructured":"Dang, Y., Gao, Y.: The strong convergence of a KM-CQ-algorithm for a split feasibility problem, Inverse Probl. (2011). ID: 015007","DOI":"10.1088\/0266-5611\/27\/1\/015007"},{"key":"9949_CR7","doi-asserted-by":"crossref","unstructured":"Zhao, J., Yang, Q. Self-adaptive projection methods for the multiple-sets split feasibility problem, Inverse Probl. (2011). ID:035009","DOI":"10.1088\/0266-5611\/27\/3\/035009"},{"key":"9949_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, W., Han, D., Li, Z. A self-adaptive projection method for solving the multiple-sets split feasibility problem, Inverse Probl. (2009). ID:115001","DOI":"10.1088\/0266-5611\/25\/11\/115001"},{"key":"9949_CR9","doi-asserted-by":"crossref","unstructured":"Yao, Y.H., Postolache, M., Liou, Y.C.: Strong convergence of a self-adaptive method for the split feasibility problem. Fixed Point Theory and Applications (2013). doi: 10.1186\/1687-1812-2013-201","DOI":"10.1186\/1687-1812-2013-201"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9949-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9949-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9949-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T10:17:27Z","timestamp":1566123447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9949-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,18]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9949"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9949-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,18]]}}}