{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:35Z","timestamp":1740122435867,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ISF-NSFC","award":["2874\/19","2874\/19"],"award-info":[{"award-number":["2874\/19","2874\/19"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10898-022-01175-7","type":"journal-article","created":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T03:23:26Z","timestamp":1653881006000},"page":"967-987","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A generalized block-iterative projection method for the common fixed point problem induced by cutters"],"prefix":"10.1007","volume":"84","author":[{"given":"Yair","family":"Censor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3190-2720","authenticated-orcid":false,"given":"Daniel","family":"Reem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maroun","family":"Zaknoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"key":"1175_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0024-3795(89)90375-3","volume":"120","author":"R Aharoni","year":"1989","unstructured":"Aharoni, R., Censor, Y.: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems. Linear Algebra Appl. 120, 165\u2013175 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1175_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.jmaa.2008.01.087","volume":"343","author":"A Aleyner","year":"2008","unstructured":"Aleyner, A., Reich, S.: Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces. J. Math. Anal. Appl. 343, 427\u2013435 (2008)","journal-title":"J. Math. Anal. Appl."},{"key":"1175_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: A weak-to-strong convergence principle for Fej\u00e9r-monotone methods in Hilbert spaces. Math. Oper. Res. 26, 248\u2013264 (2001)","DOI":"10.1287\/moor.26.2.248.10558"},{"key":"1175_CR4","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":"1175_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer International Publishing, Cham (2017)","edition":"2"},{"key":"1175_CR6","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/s10957-014-0659-7","volume":"165","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Wang, C., Wang, X., Xu, J.: On the finite convergence of a projected cutter method. J. Optim. Theory Appl. 165, 901\u2013916 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1175_CR7","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1137\/14096267X","volume":"25","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Wang, C., Wang, X., Xu, J.: On subgradient projectors. SIAM J. Optim. 25, 1064\u20131082 (2015)","journal-title":"SIAM J. Optim."},{"key":"1175_CR8","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"Comput. Math. Math. Phys."},{"key":"1175_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/00207169008803865","volume":"34","author":"D Butnariu","year":"1990","unstructured":"Butnariu, D., Censor, Y.: On the behavior of a block-iterative projection method for solving convex feasibility problems. Int. J. Comput. Math. 34, 79\u201394 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"1175_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0377-0427(92)00123-Q","volume":"53","author":"D Butnariu","year":"1994","unstructured":"Butnariu, D., Censor, Y.: Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces. J. Comput. Appl. Math. 53, 33\u201342 (1994)","journal-title":"J. Comput. Appl. Math."},{"key":"1175_CR11","doi-asserted-by":"publisher","first-page":"4318","DOI":"10.1016\/j.cam.2012.03.021","volume":"236","author":"A Carmi","year":"2012","unstructured":"Carmi, A., Censor, Y., Gurfil, P.: Convex feasibility modeling and projection methods for sparse signal recovery. J. Comput. Appl. Math. 236, 4318\u20134335 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"1175_CR12","volume-title":"Iterative Methods for Fixed Point Problems in Hilbert Spaces","author":"A Cegielski","year":"2012","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Springer-Verlag, Berlin (2012)"},{"key":"1175_CR13","doi-asserted-by":"crossref","unstructured":"Cegielski, A., Censor, Y.: Opial-type theorems and the common fixed point problem. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (Eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer New York, NY, USA, (New York, NY, 2011) pp.\u00a0155\u2013183","DOI":"10.1007\/978-1-4419-9569-8_9"},{"key":"1175_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1515\/auom-2015-0046","volume":"23","author":"Y Censor","year":"2015","unstructured":"Censor, Y.: Weak and strong superiorization: between feasibility-seeking and minimization. Analele Stiintifice ale Universitatii Ovidius Constanta-Seria Matematica. 23, 41\u201354 (2015)","journal-title":"Analele Stiintifice ale Universitatii Ovidius Constanta-Seria Matematica."},{"key":"1175_CR15","unstructured":"Censor, Y.: Superiorization and perturbation resilience of algorithms: A continuously updated bibliography, 2022. http:\/\/math.haifa.ac.il\/yair\/bib-superiorization-censor.html, with 153 references, as of may 21, 2022"},{"key":"1175_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00245-011-9139-8","volume":"64","author":"Y Censor","year":"2011","unstructured":"Censor, Y., Chen, W., Pajoohesh, H.: Finite convergence of a subgradient projections method with expanding controls. Appl. Math. Optim. 64, 273\u2013285 (2011)","journal-title":"Appl. Math. Optim."},{"key":"1175_CR17","doi-asserted-by":"publisher","first-page":"065008","DOI":"10.1088\/0266-5611\/26\/6\/065008","volume":"26","author":"Y Censor","year":"2010","unstructured":"Censor, Y., Davidi, R., Herman, G.T.: Perturbation resilience and superiorization of iterative algorithms. Inverse Prob 26, 065008 (2010)","journal-title":"Inverse Prob"},{"key":"1175_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/050639399","volume":"30","author":"Y Censor","year":"2008","unstructured":"Censor, Y., Elfving, T., Herman, G.T., Nikazad, T.: On diagonally relaxed orthogonal projection methods. SIAM J. Sci. Comput. 30, 473\u2013504 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"1175_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-014-0788-7","volume":"152","author":"Y Censor","year":"2015","unstructured":"Censor, Y., Reem, D.: Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods. Math. Program. (Series A) 152, 339\u2013380 (2015)","journal-title":"Math. Program. (Series A)"},{"key":"1175_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1111\/j.1475-3995.2008.00684.x","volume":"16","author":"Y Censor","year":"2009","unstructured":"Censor, Y., Segal, A.: On the string averaging method for sparse common fixed-point problems. Int. Trans. Oper. Res. 16, 481\u2013494 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"1175_CR21","first-page":"587","volume":"16","author":"Y Censor","year":"2009","unstructured":"Censor, Y., Segal, A.: The split common fixed point problem for directed operators. J. Convex Anal. 16, 587\u2013600 (2009)","journal-title":"J. Convex Anal."},{"key":"1175_CR22","unstructured":"Censor, Y., Zaknoon, M.: Methods for finding a common fixed point of a collection of directed operators. Unpublished Technical Report (2003)"},{"key":"1175_CR23","unstructured":"Censor, Y., Zenios, A.S.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, New York, NY, USA, (1997). With a foreword by George B. Dantzig"},{"key":"1175_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S1076-5670(08)70157-5","volume":"95","author":"PL Combettes","year":"1996","unstructured":"Combettes, P.L.: The convex feasibility problem in image recovery. Adv. Imag. Electron Phys. 95, 155\u2013270 (1996)","journal-title":"Adv. Imag. Electron Phys."},{"key":"1175_CR25","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S036301299732626X","volume":"38","author":"PL Combettes","year":"2000","unstructured":"Combettes, P.L.: Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J. Control. Optim. 38, 538\u2013565 (2000)","journal-title":"SIAM J. Control. Optim."},{"key":"1175_CR26","doi-asserted-by":"crossref","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: Butnariu D., Censor, Y., Reich, S. (Eds.), Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Elsevier Science Publishers, Amsterdam, The Netherlands (2001), pp.\u00a0115\u2013152","DOI":"10.1016\/S1570-579X(01)80010-0"},{"key":"1175_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1111\/j.1475-3995.2009.00695.x","volume":"16","author":"R Davidi","year":"2009","unstructured":"Davidi, R., Herman, G.T., Censor, Y.: Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections. Int. Trans. Oper. Res. 16, 505\u2013524 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"1175_CR28","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF02017349","volume":"30","author":"SD Fl\u00e5m","year":"1990","unstructured":"Fl\u00e5m, S.D., Zowe, J.: Relaxed outer projections, weighted averages and convex feasibility. BIT 30, 289\u2013300 (1990)","journal-title":"BIT"},{"key":"1175_CR29","doi-asserted-by":"crossref","unstructured":"Gholami, M.\u00a0R., Wymeersch, H., Str\u00f6m, E.\u00a0G., Rydstr\u00f6m, M.: Wireless network positioning as a convex feasibility problem. EURASIP J. Wireless Commun. Netw. 2011 (2011), 161 (15 pages)","DOI":"10.1186\/1687-1499-2011-161"},{"key":"1175_CR30","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s10589-018-9991-4","volume":"70","author":"A Gibali","year":"2018","unstructured":"Gibali, A., K\u00fcfer, K.H., Reem, D., S\u00fcss, P.: A generalized projection-based scheme for solving convex constrained optimization problems. Comput. Optim. Appl. 70, 737\u2013762 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"1175_CR31","doi-asserted-by":"crossref","unstructured":"Herman, G.\u00a0T.: Superiorization for image analysis. In: Combinatorial Image Analysis, Lecture Notes in Computer Science. Springer, vol. 8466, pp.\u00a01\u20137 (2014)","DOI":"10.1007\/978-3-319-07148-0_1"},{"key":"1175_CR32","unstructured":"Hero, A., Blatt, D.: Sensor network source localization via projection onto convex sets (POCS). In: Proceedings. (ICASSP \u201905). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., vol.\u00a03, pp.\u00a0689\u2013692 (2005)"},{"key":"1175_CR33","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis (Abridged version of \u201cConvex analysis and Minimization Algorithms. I, II, Springer, 1993\u201d), Grundlehren Text Editions, Springer-Verlag, Berlin (2001)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"1175_CR34","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/01630560802000835","volume":"29","author":"T Ibaraki","year":"2008","unstructured":"Ibaraki, T., Takahashi, W.: Block iterative methods for a finite family of generalized nonexpansive mappings in Banach spaces. Numer. Funct. Anal. Optim. 29, 362\u2013375 (2008)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1175_CR35","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1016\/j.jpdc.2013.07.016","volume":"73","author":"NT Karonis","year":"2013","unstructured":"Karonis, N.T., Dun, K.L., Ordo\u00f1ez, C.E., Erdely, B., Uram, T.D., Olson, E.C., Coutrakon, G., Papka, M.E.: Distributed and hardware accelerated computing for clinical medical imaging using proton computed tomography (pCT). J. Parallel Distrib. Comput. 73, 1605\u20131612 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1175_CR36","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1137\/16M1087333","volume":"27","author":"VI Kolobov","year":"2017","unstructured":"Kolobov, V.I., Reich, S., Zalas, R.: Weak, strong, and linear convergence of a double-layer fixed point algorithm. SIAM J. Optim. 27, 1431\u20131458 (2017)","journal-title":"SIAM J. Optim."},{"key":"1175_CR37","doi-asserted-by":"publisher","unstructured":"Necoara, I.: Stochastic block projection algorithms with extrapolation for convex feasibility problems, Optimization Methods and Software, to appear (published online: 2022). https:\/\/doi.org\/10.1080\/10556788.2021.1998492","DOI":"10.1080\/10556788.2021.1998492"},{"key":"1175_CR38","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/33\/4\/044001","volume":"33","author":"D Reem","year":"2017","unstructured":"Reem, D., De Pierro, A.R.: A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors. Inverse Prob. 33, 044001 (2017)","journal-title":"Inverse Prob."},{"key":"1175_CR39","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11075-015-0045-z","volume":"72","author":"S Reich","year":"2016","unstructured":"Reich, S., Zalas, R.: A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space. Numer. Algo. 72, 297\u2013323 (2016)","journal-title":"Numer. Algo."},{"key":"1175_CR40","unstructured":"Zaknoon, M.: Algorithmic Developments for the Convex Feasibility Problem. PhD Thesis, University of Haifa, Haifa, Israel, (2003)"},{"key":"1175_CR41","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33255-0","volume-title":"Approximate Solutions of Common Fixed Point Problems","author":"AJ Zaslavski","year":"2016","unstructured":"Zaslavski, A.J.: Approximate Solutions of Common Fixed Point Problems. Springer Optimization and Its Applications, Springer, Cham (2016)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01175-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01175-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01175-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T18:29:17Z","timestamp":1666290557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01175-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1175"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01175-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"7 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}