{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T12:00:34Z","timestamp":1776168034187,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":34,"publisher":"Springer New York","isbn-type":[{"value":"9781441995681","type":"print"},{"value":"9781441995698","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-9569-8_9","type":"book-chapter","created":{"date-parts":[[2011,5,26]],"date-time":"2011-05-26T19:17:16Z","timestamp":1306437436000},"page":"155-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Opial-Type Theorems and the Common Fixed Point Problem"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Cegielski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Censor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,9]]},"reference":[{"key":"9_CR1_9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/0196-8858(83)90019-2","volume":"4","author":"R Aharoni","year":"1983","unstructured":"Aharoni, R., Berman, A., Censor, Y.: An interior point algorithm for the convex feasibility problem. Advances in Applied Mathematics 4, 479\u2013489 (1983)","journal-title":"Advances in Applied Mathematics"},{"key":"9_CR2_9","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 and Its Applications 120, 165\u2013175 (1989)","journal-title":"Linear Algebra and Its Applications"},{"key":"9_CR3_9","first-page":"253","volume":"20","author":"G Appleby","year":"2005","unstructured":"Appleby, G., Smolarski, D.C.: A linear acceleration row action method for projecting onto subspaces. Electronic Transactions on Numerical Analysis 20, 253\u2013275 (2005)","journal-title":"Electronic Transactions on Numerical Analysis"},{"key":"9_CR4_9","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 Review 38, 367\u2013426 (1996)","journal-title":"SIAM Review"},{"key":"9_CR5_9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","volume":"26","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Combettes, P.L.: A weak to strong convergence principle for Fej\u00e9r-monotone methods in Hilbert spaces. Mathematics of Operation Research 26, 248\u2013264 (2001)","journal-title":"Mathematics of Operation Research"},{"key":"9_CR6_9","volume-title":"Iterative Approximation of Fixed Points","author":"V Berinde","year":"2007","unstructured":"Berinde, V.: Iterative Approximation of Fixed Points. Springer-Verlag, Berlin (2007)"},{"key":"9_CR7_9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01109805","volume":"100","author":"FE Browder","year":"1967","unstructured":"Browder, F.E.: Convergence Theorems for Sequences of Nonlinear Operators in Banach Spaces. Math. Zeitschr. 100, 201\u2013225 (1967)","journal-title":"Math. Zeitschr."},{"key":"9_CR8_9","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. Intern. J. Computer Math. 34, 79\u201394 (1990)","journal-title":"Intern. J. Computer Math."},{"key":"9_CR9_9","doi-asserted-by":"publisher","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 Problems 20, 103\u2013120 (2004)","journal-title":"Inverse Problems"},{"key":"9_CR10_9","unstructured":"Cegielski, A.: Relaxation Methods in Convex Optimization Problems. Monographs, Vol. 67, Institute of Mathematics, Higher College of Engineering, Zielona G\u00f3ra (1993) (in Polish)"},{"key":"9_CR11_9","first-page":"601","volume":"36","author":"A Cegielski","year":"2007","unstructured":"Cegielski, A.: A generalization of the Opial\u2019s Theorem. Control and Cybernetics 36, 601\u2013610 (2007)","journal-title":"Control and Cybernetics"},{"key":"9_CR12_9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1090\/conm\/513\/10078","volume":"513","author":"A Cegielski","year":"2010","unstructured":"Cegielski, A.: Generalized relaxations of nonexpansive operators and convex feasibility problems. Contemporary Mathematics 513, 111\u2013123 (2010)","journal-title":"Contemporary Mathematics"},{"key":"9_CR13_9","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y Censor","year":"1981","unstructured":"Censor, Y.: Row-action methods for huge and sparse systems and their applications. SIAM Review 23, 444\u2013466 (1981)","journal-title":"SIAM Review"},{"key":"9_CR14_9","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. International Transactions in Operational Research 16, 481\u2013494 (2009)","journal-title":"International Transactions in Operational Research"},{"key":"9_CR15_9","first-page":"587","volume":"16","author":"Y Censor","year":"2009","unstructured":"Censor, Y., Segal, A.: The split common fixed point problem for directed operators. Journal of Convex Analysis 16, 587\u2013600 (2009)","journal-title":"Journal of Convex Analysis"},{"key":"9_CR16_9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1090\/conm\/513\/10079","volume":"513","author":"Y Censor","year":"2010","unstructured":"Censor, Y., Segal, A.: On string-averaging for sparse problems and on the split common fixed point problem. Contemporary Mathematics 513, 125\u2013142 (2010)","journal-title":"Contemporary Mathematics"},{"key":"9_CR17_9","volume-title":"Parallel Optimization: Theory","author":"Y Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, New York, NY, USA (1997)"},{"key":"9_CR18_9","first-page":"326","volume":"1","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica XVI Series II, Anno IX 1, 326\u2013333 (1938)","journal-title":"La Ricerca Scientifica XVI Series II, Anno IX"},{"key":"9_CR19_9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/83.563316","volume":"6","author":"PL Combettes","year":"1997","unstructured":"Combettes, P.L.: Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections. IEEE Transactions on Image Processing 6, 493\u2013506 (1997)","journal-title":"IEEE Transactions on Image Processing"},{"key":"9_CR20_9","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 problems: Convergence of projection methods. Appl. Math. Optim. 35, 311\u2013330 (1997)","journal-title":"Appl. Math. Optim."},{"key":"9_CR21_9","doi-asserted-by":"crossref","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: D. Butnariu, Y. Censor and S. Reich (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, Elsevier Science Publishers, Amsterdam, The Netherlands, 115\u2013152 (2001)","DOI":"10.1016\/S1570-579X(01)80010-0"},{"key":"9_CR22_9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1081\/NFA-200063882","volume":"26","author":"G Crombez","year":"2005","unstructured":"Crombez, G.: A geometrical look at iterative methods for operators with fixed points. Numerical Functional Analysis and Optimization 26, 157\u2013175 (2005)","journal-title":"Numerical Functional Analysis and Optimization"},{"key":"9_CR23_9","volume-title":"Metodos de proje\u00e7\u00e3o para a resolu\u00e7\u00e3o de sistemas gerais de equa\u00e7\u00f5es alg\u00e9bricas lienaers","author":"AR De Pierro","year":"1981","unstructured":"De Pierro, A.R.: Metodos de proje\u00e7\u00e3o para a resolu\u00e7\u00e3o de sistemas gerais de equa\u00e7\u00f5es alg\u00e9bricas lienaers. Tese de Doutoramento, Instituto de Matem\u00e1tica, Universidade Federal do Rio de Janeiro (IM-UFRJ) (1981)"},{"key":"9_CR24_9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-0427(87)90004-5","volume":"18","author":"LT Dos Santos","year":"1987","unstructured":"Dos Santos, L.T.: A parallel subgradient projections method for the convex feasibility problem. J. Comp. and Applied Math 18, 307\u2013320 (1987)","journal-title":"J. Comp. and Applied Math"},{"key":"9_CR25_9","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":"9_CR26_9","volume-title":"Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings","author":"K Goebel","year":"1984","unstructured":"Goebel, K., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Marcel Dekker, New York and Basel (1984)"},{"key":"9_CR27_9","doi-asserted-by":"crossref","unstructured":"Gurin, L.G., Polyak, B.T., Raik, E.V.: The method of projection for finding the common point in convex sets. Zh. Vychisl. Mat. i Mat. Fiz. 7 1211\u20131228 (1967) (in Russian). English translation in: USSR Comput. Math. Phys. 7, 1\u201324 (1967)","DOI":"10.1016\/0041-5553(67)90113-9"},{"key":"9_CR28_9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01389537","volume":"49","author":"AN Iusem","year":"1986","unstructured":"Iusem, A.N., De Pierro, A.R.: Convergence results for an accelerated nonlinear Cimmino algorithm. Numerische Mathematik 49, 367\u2013378 (1986)","journal-title":"Numerische Mathematik"},{"key":"9_CR29_9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0024-3795(93)00089-I","volume":"215","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Block-iterative surrogate projection methods for convex feasibility problems. Linear Algebra and Applications 215, 225\u2013259 (1995)","journal-title":"Linear Algebra and Applications"},{"key":"9_CR30_9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Amer. Math. Soc. 73, 591\u2013597 (1967)","journal-title":"Bull. Amer. Math. Soc."},{"key":"9_CR31_9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1080\/02331939108843731","volume":"22","author":"D Schott","year":"1991","unstructured":"Schott, D.: A general iterative scheme with applications to convex optimization and related fields. Optimization 22, 885\u2013902 (1991)","journal-title":"Optimization"},{"key":"9_CR32_9","unstructured":"Segal, A.: Directed Operators for Common Fixed Point Problems and Convex Programming Problems. Ph.D. Thesis, University of Haifa, Haifa, Israel (2008)"},{"key":"9_CR33_9","unstructured":"Zaknoon, M.: Algorithmic Developments for the Convex Feasibility Problem. Ph.D. Thesis, University of Haifa, Haifa, Israel (2003)"},{"key":"9_CR34_9","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1088\/0266-5611\/21\/5\/017","volume":"21","author":"J Zhao","year":"2005","unstructured":"Zhao, J., Yang, Q.: Several solution methods for the split feasibility problem. Inverse Problems 21, 1791\u20131799 (2005)","journal-title":"Inverse Problems"}],"container-title":["Springer Optimization and Its Applications","Fixed-Point Algorithms for Inverse Problems in Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-9569-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T15:48:08Z","timestamp":1675093688000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-9569-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441995681","9781441995698"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-9569-8_9","relation":{},"ISSN":["1931-6828"],"issn-type":[{"value":"1931-6828","type":"print"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"9 May 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}