{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:44:34Z","timestamp":1773384274114,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T00:00:00Z","timestamp":1495152000000},"content-version":"unspecified","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":[[2018,3]]},"DOI":"10.1007\/s11075-017-0347-4","type":"journal-article","created":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T03:36:41Z","timestamp":1495165001000},"page":"925-938","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Polyak\u2019s gradient method for split feasibility problem constrained by level sets"],"prefix":"10.1007","volume":"77","author":[{"given":"Fenghui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"key":"347_CR1","doi-asserted-by":"crossref","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":"347_CR2","first-page":"844","volume":"265","author":"OA Boikanyo","year":"2015","unstructured":"Boikanyo, O. A.: A strongly convergent algorithm for the split common fixed point problem. Appl. Math. Comput. 265, 844\u2013853 (2015)","journal-title":"Appl. Math. Comput."},{"key":"347_CR3","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 sets and the split feasibility problem. Inverse Prob. 18, 441\u2013453 (2002)","journal-title":"Inverse Prob."},{"key":"347_CR4","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 Prob. 20, 103\u2013120 (2004)","journal-title":"Inverse Prob."},{"key":"347_CR5","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1088\/0031-9155\/51\/10\/001","volume":"51","author":"Y Censor","year":"2003","unstructured":"Censor, Y., Bortfeld, T., Martin, B., Trofimov, A.: A unified approach for inversion problems in intensitymodulated radiation therapy. Phys. Med. Biol. 51, 2353\u20132365 (2003)","journal-title":"Phys. Med. Biol."},{"key":"347_CR6","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 algorithms using Bregman projection in a product space. Numer. Algorithm 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithm"},{"key":"347_CR7","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1090\/S0002-9939-1959-0105008-8","volume":"10","author":"W Cheney","year":"1959","unstructured":"Cheney, W., Goldstein, A. A.: Proximity maps for convex sets. Proc. Amer. Math. Soc. 10, 448\u2013450 (1959)","journal-title":"Proc. Amer. Math. Soc."},{"key":"347_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02683333","volume":"35","author":"PL Combettes","year":"1997","unstructured":"Combettes, P. L.: Hilbertian convex feasibility problem: Convergence of projection methods. Appl. Math. Optim. 35, 311\u2013330 (1997)","journal-title":"Appl. Math. Optim."},{"key":"347_CR9","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P. L., Wajs, V. R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"347_CR10","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1007\/s00041-008-9039-8","volume":"14","author":"I Daubechies","year":"2008","unstructured":"Daubechies, I., Fornasier, M., Loris, I.: Accelerated projected gradient method for linear inverse problems with sparsity constraints. J. Fourier Anal. Appl. 14, 764\u201392 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"347_CR11","doi-asserted-by":"crossref","unstructured":"Duchi, J. C., Shalevshwartz, S., Singer, Y., et al.: Efficient projections onto the \u2113 1 -ball for learning in high dimensions. In: International Conference on Machine Learning, pp. 272\u2013279 (2008)","DOI":"10.1145\/1390156.1390191"},{"key":"347_CR12","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MA Figueiredo","year":"2007","unstructured":"Figueiredo, M. A., Nowak, R. D., Wright, S. J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process 1, 586\u2013598 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process"},{"key":"347_CR13","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BF01589441","volume":"35","author":"M Fukushima","year":"1986","unstructured":"Fukushima, M.: A relaxed projection method for variational inequalities. Math. Program. 35, 58\u201370 (1986)","journal-title":"Math. Program."},{"key":"347_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"LG Gubin","year":"1967","unstructured":"Gubin, L. G., Polyak, B. T., Raik, E. V.: The method of projections for finding the common point of convex sets. USSR Comput. Math. Math. Phys. 7, 1\u201324 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"347_CR15","first-page":"96","volume":"23","author":"I Halperin","year":"1962","unstructured":"Halperin, I.: The product of projection operators. Acta. Sci. Math. (Szeged) 23, 96\u201399 (1962)","journal-title":"Acta. Sci. Math. (Szeged)"},{"key":"347_CR16","doi-asserted-by":"crossref","first-page":"085004","DOI":"10.1088\/0266-5611\/28\/8\/085004","volume":"28","author":"G L\u00f3pez","year":"2012","unstructured":"L\u00f3pez, G., Mat\u00edn, V., Wang, F., Xu, H.K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Prob. 28, 085004 (2012)","journal-title":"Inverse Prob."},{"key":"347_CR17","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.jmaa.2014.01.068","volume":"415","author":"P Kraikaew","year":"2014","unstructured":"Kraikaew, P., Saejung, S.: On split common fixed point problems. J. Math. Anal. Appl. 415, 513\u2013524 (2014)","journal-title":"J. Math. Anal. Appl."},{"key":"347_CR18","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B. T.: Minimization of unsmooth functionals. UUSSR Comput. Math. Math. Phys. 9, 14\u201329 (1969)","journal-title":"UUSSR Comput. Math. Math. Phys."},{"key":"347_CR19","doi-asserted-by":"crossref","first-page":"055008","DOI":"10.1088\/0266-5611\/24\/5\/055008","volume":"24","author":"F Sch\u00f6pfer","year":"2008","unstructured":"Sch\u00f6pfer, F., Schuster, T., Louis, A.K.: An iterative regularization method for the solution of the split feasibility problem in Banach spaces. Inverse Prob. 24, 055008 (2008)","journal-title":"Inverse Prob."},{"key":"347_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511730344","volume-title":"Sparse image and signal processing. Wavelets, curvelets, morphological diversity","author":"JL Starck","year":"2010","unstructured":"Starck, J. L., Murtagh, F., Fadili, J. M.: Sparse image and signal processing. Wavelets, curvelets, morphological diversity. Cambridge University Press, Cambridge (2010)"},{"key":"347_CR21","first-page":"212","volume":"13","author":"WJ Stiles","year":"1965","unstructured":"Stiles, W. J.: Closest point maps and their product II. Nieuw Arch Wisk 13, 212\u2013225 (1965)","journal-title":"Nieuw Arch Wisk"},{"key":"347_CR22","unstructured":"van den Berg, E., Friedlander, M. P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)"},{"key":"347_CR23","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/1969463","volume":"50","author":"J von Neumann","year":"1949","unstructured":"von Neumann, J.: On rings of operators. Reduction theory. Ann. Math. 50, 401\u2013485 (1949)","journal-title":"Ann. Math."},{"key":"347_CR24","doi-asserted-by":"crossref","unstructured":"Wang, F.: On the convergence of CQ algorithm with variable steps for the split equality problem, 74:927\u2013935 (2017)","DOI":"10.1007\/s11075-016-0177-9"},{"key":"347_CR25","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"HK Xu","year":"2002","unstructured":"Xu, H. K.: Iterative algorithms for nonlinear operators. J. London Math. Soc. 66, 240\u2013256 (2002)","journal-title":"J. London Math. Soc."},{"key":"347_CR26","doi-asserted-by":"crossref","first-page":"2021","DOI":"10.1088\/0266-5611\/22\/6\/007","volume":"22","author":"HK Xu","year":"2006","unstructured":"Xu, H. K.: A variable Krasnosel\u2019skii-Mann algorithm and the multiple-set split feasibility problem. Inverse Prob. 22, 2021\u20132034 (2006)","journal-title":"Inverse Prob."},{"key":"347_CR27","doi-asserted-by":"crossref","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 the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Prob. 26, 105018 (2010)","journal-title":"Inverse Prob."},{"key":"347_CR28","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s11401-014-0829-9","volume":"35","author":"HK Xu","year":"2014","unstructured":"Xu, H. K.: Properties and iterative methods for the Lasso and its variants. Chin. Ann. Math. Ser. B 35, 501\u2013518 (2014)","journal-title":"Chin. Ann. Math. Ser. B"},{"key":"347_CR29","doi-asserted-by":"crossref","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 for solving the split feasibility problem. Inverse Prob. 20, 1261\u20131266 (2004)","journal-title":"Inverse Prob."},{"key":"347_CR30","doi-asserted-by":"crossref","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0347-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0347-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0347-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T20:52:02Z","timestamp":1569358322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0347-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,19]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["347"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0347-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,19]]}}}