{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:20:23Z","timestamp":1776122423148,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,30]],"date-time":"2005-12-30T00:00:00Z","timestamp":1135900800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s11075-005-9010-6","type":"journal-article","created":{"date-parts":[[2005,12,29]],"date-time":"2005-12-29T16:43:19Z","timestamp":1135874599000},"page":"239-274","source":"Crossref","is-referenced-by-count":68,"title":["Extrapolation algorithm for affine-convex feasibility problems"],"prefix":"10.1007","volume":"41","author":[{"given":"Heinz H.","family":"Bauschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick L.","family":"Combettes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge G.","family":"Kruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,12,30]]},"reference":[{"key":"9010_CR1","doi-asserted-by":"crossref","unstructured":"A. Auslender, M\u00e9thodes Num\u00e9riques pour la R\u00e9solution des Probl\u00e8mes d\u2019Optimisation avec Contraintes, Th\u00e8se, Facult\u00e9 des Sciences, Grenoble, France (1969).","DOI":"10.1051\/m2an\/196903R200271"},{"key":"9010_CR2","unstructured":"H.H. Bauschke, Projection algorithms and monotone operators, PhD Thesis, Department of Mathematics, Simon Fraser University, Burnaby, British Columbia, Canada (August 1996). Available at http:\/\/www.cecm.sfu.ca\/preprints\/1996pp.html ."},{"key":"9010_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H.H. Bauschke","year":"1996","unstructured":"H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367\u2013426.","journal-title":"SIAM Rev."},{"key":"9010_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","volume":"26","author":"H.H. Bauschke","year":"2001","unstructured":"H.H. Bauschke and P.L. Combettes, A weak-to-strong convergence principle for Fej\u00e9r-monotone methods in Hilbert spaces, Math. Oper. Res. 26 (2001) 248\u2013264.","journal-title":"Math. Oper. Res."},{"key":"9010_CR5","unstructured":"H.H. Bauschke, F. Deutsch, H. Hundal and S.-H. Park, Fej\u00e9r monotonicity and weak convergence of an accelerated method of projections, in: Constructive, Experimental, and Nonlinear Analysis, ed. M. Th\u00e9ra (CMS Conference Proceedings 27, 2000) pp. 1\u20136."},{"key":"9010_CR6","doi-asserted-by":"crossref","first-page":"3433","DOI":"10.1090\/S0002-9947-03-03136-2","volume":"355","author":"H.H. Bauschke","year":"2003","unstructured":"H.H. Bauschke, F. Deutsch, H. Hundal, and S.-H. Park, Accelerating the convergence of the method of alternating projections, Trans. Am. Math. Soc. 355 (2003) 3433\u20133461.","journal-title":"Trans. Am. Math. Soc."},{"key":"9010_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1023\/B:JOTA.0000025708.31430.22","volume":"120","author":"H.H. Bauschke","year":"2004","unstructured":"H.H. Bauschke and S.G. Kruk, Reflection-projection method for convex feasibility problems with an obtuse cone, J. Optim. Theory Appl. 120 (2004) 503\u2013531.","journal-title":"J. Optim. Theory Appl."},{"key":"9010_CR8","first-page":"123","volume":"63","author":"E. Blum","year":"1994","unstructured":"E. Blum and W. Oettli, From optimization and variational inequalities to equilibrium problems, Math. Stud. 63 (1994) 123\u2013145.","journal-title":"Math. Stud."},{"key":"9010_CR9","first-page":"688","volume":"6","author":"L.M. Bregman","year":"1965","unstructured":"L.M. Bregman, The method of successive projection for finding a common point of convex sets, Sov. Math., Dokl. 6 (1965) 688\u2013692.","journal-title":"Sov. Math., Dokl."},{"key":"9010_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01109805","volume":"100","author":"F.E. Browder","year":"1967","unstructured":"F.E. Browder, Convergence theorems for sequences of nonlinear operators in Banach spaces, Math. Z. 100 (1967) 201\u2013225.","journal-title":"Math. Z."},{"key":"9010_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/00207169008803865","volume":"34","author":"D. Butnariu","year":"1990","unstructured":"D. Butnariu and Y. Censor, On the behavior of a block-iterative projection method for solving convex feasibility problems, Int. J. Comput. Math. 34 (1990) 79\u201394.","journal-title":"Int. J. Comput. Math."},{"key":"9010_CR12","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications","year":"2001","unstructured":"D. Butnariu, Y. Censor and S. Reich, eds., Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Elsevier, New York, 2001)."},{"key":"9010_CR13","first-page":"536","volume":"25","author":"A. Cauchy","year":"1847","unstructured":"A. Cauchy, M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des syst\u00e8mes d\u2019\u00e9quations simultan\u00e9es, C. R. Acad. Sci. Paris 25 (1847) 536\u2013538.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"9010_CR14","first-page":"83","volume":"20","author":"Y. Censor","year":"1984","unstructured":"Y. Censor, Iterative methods for the convex feasibility problem, Ann. Discrete Math. 20 (1984) 83\u201391.","journal-title":"Ann. Discrete Math."},{"key":"9010_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01585107","volume":"24","author":"Y. Censor","year":"1982","unstructured":"Y. Censor and A. Lent, Cyclic subgradient projections, Math. Program. 24 (1982) 233\u2013235.","journal-title":"Math. Program."},{"key":"9010_CR16","volume-title":"Parallel Optimization: Theory, Algorithms, and Applications","author":"Y. Censor","year":"1997","unstructured":"Y. Censor and S.A. Zenios, Parallel Optimization: Theory, Algorithms, and Applications (Oxford University Press, New York, 1997)."},{"key":"9010_CR17","first-page":"326","volume":"1","author":"G. Cimmino","year":"1938","unstructured":"G. Cimmino, Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari, La Ricerca Scientifica (Roma) 1 (1938) 326\u2013333.","journal-title":"La Ricerca Scientifica (Roma)"},{"key":"9010_CR18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/5.214546","volume":"81","author":"P.L. Combettes","year":"1993","unstructured":"P.L. Combettes, The foundations of set theoretic estimation, Proc. IEEE 81 (1993) 182\u2013208.","journal-title":"Proc. IEEE"},{"key":"9010_CR19","first-page":"1385","volume":"320","author":"P.L. Combettes","year":"1995","unstructured":"P.L. Combettes, Construction d\u2019un point fixe commun \u00e0 une famille de contractions fermes, C. R. Acad. Sci. Paris S\u00e9r. I Math. 320 (1995) 1385\u20131390.","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."},{"key":"9010_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S1076-5670(08)70157-5","volume-title":"Advances in Imaging and Electron Physics, Vol. 95","author":"P.L. Combettes","year":"1996","unstructured":"P.L. Combettes, The convex feasibility problem in image recovery, in: Advances in Imaging and Electron Physics, ed. P. Hawkes, Vol. 95, (Academic, New York, 1996) pp. 155\u2013270."},{"key":"9010_CR21","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/83.563316","volume":"6","author":"P.L. Combettes","year":"1997","unstructured":"P.L. Combettes, Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections, IEEE Trans. Image Process. 6 (1997) 493\u2013506.","journal-title":"IEEE Trans. Image Process."},{"key":"9010_CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02683333","volume":"35","author":"P.L. Combettes","year":"1997","unstructured":"P.L. Combettes, Hilbertian convex feasibility problem: Convergence of projection methods, Appl. Math. Optim. 35 (1997) 311\u2013330.","journal-title":"Appl. Math. Optim."},{"key":"9010_CR23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S1570-579X(01)80010-0","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications","author":"P.L. Combettes","year":"2001","unstructured":"P.L. Combettes, Quasi-Fej\u00e9rian analysis of some optimization algorithms, in: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, eds. D. Butnariu, Y. Censor and S. Reich (Elsevier, New York, 2001) pp. 115\u2013152."},{"key":"9010_CR24","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"P.L. Combettes","year":"2004","unstructured":"P.L. Combettes, Solving monotone inclusions via compositions of nonexpansive averaged operators, Optimization 53 (2004) 475\u2013504.","journal-title":"Optimization"},{"key":"9010_CR25","first-page":"117","volume":"6","author":"P.L. Combettes","year":"2005","unstructured":"P.L. Combettes and S.A. Hirstoaga, Equilibrium programming in Hilbert spaces, J. Nonlinear Convex Anal. 6 (2005) 117\u2013136.","journal-title":"J. Nonlinear Convex Anal."},{"key":"9010_CR26","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0022-247X(91)90010-W","volume":"155","author":"G. Crombez","year":"1991","unstructured":"G. Crombez, Image recovery by convex combinations of projections, J. Math. Anal. Appl. 155 (1991) 413\u2013419.","journal-title":"J. Math. Anal. Appl."},{"key":"9010_CR27","doi-asserted-by":"crossref","first-page":"2575","DOI":"10.1090\/S0002-9947-1995-1277105-1","volume":"347","author":"G. Crombez","year":"1995","unstructured":"G. Crombez, Viewing parallel projection methods as sequential ones in convex feasibility problems, Trans. Am. Math. Soc. 347 (1995) 2575\u20132583.","journal-title":"Trans. Am. Math. Soc."},{"key":"9010_CR28","first-page":"1","volume":"5","author":"A.R. Pierro De","year":"1985","unstructured":"A.R. De Pierro and A.N. Iusem, A parallel projection method for finding a common point of a family of convex sets, Pesqui. Oper. 5 (1985) 1\u201320.","journal-title":"Pesqui. Oper."},{"key":"9010_CR29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-94-011-2634-2_5","volume-title":"Approximation Theory, Spline Functions and Applications","author":"F. Deutsch","year":"1992","unstructured":"F. Deutsch, The method of alternating orthogonal projections, in: Approximation Theory, Spline Functions and Applications, ed. S.P. Singh (Kluwer, The Netherlands, 1992) pp. 105\u2013121."},{"key":"9010_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best Approximation in Inner Product Spaces","author":"F. Deutsch","year":"2001","unstructured":"F. Deutsch, Best Approximation in Inner Product Spaces (Springer, Berlin Heidelberg New York, 2001)."},{"key":"9010_CR31","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-0427(87)90004-5","volume":"18","author":"L.T. Santos Dos","year":"1987","unstructured":"L.T. Dos Santos, A parallel subgradient projections method for the convex feasibility problem, J. Comput. Appl. Math. 18 (1987) 307\u2013320.","journal-title":"J. Comput. Appl. Math."},{"key":"9010_CR32","first-page":"183","volume":"20","author":"I.I. Eremin","year":"1965","unstructured":"I.I. Eremin, Generalization of the relaxation method of Motzkin\u2013Agmon, Uspekhi Mat. Nauk 20 (1965) 183\u2013187.","journal-title":"Uspekhi Mat. Nauk"},{"key":"9010_CR33","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02017349","volume":"30","author":"S.D. Fl\u00e5m","year":"1990","unstructured":"S.D. Fl\u00e5m and J. Zowe, Relaxed outer projections, weighted averages, and convex feasibility, BIT 30 (1990) 289\u2013300.","journal-title":"BIT"},{"key":"9010_CR34","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1137\/0803046","volume":"3","author":"U. Garc\u00eda-Palomares","year":"1993","unstructured":"U. Garc\u00eda-Palomares, Parallel-projected aggregation methods for solving the convex feasibility problem, SIAM J. Optim. 3 (1993) 882\u2013900.","journal-title":"SIAM J. Optim."},{"key":"9010_CR35","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1019165330848","volume":"18","author":"U.M. Garc\u00eda-Palomares","year":"1998","unstructured":"U.M. Garc\u00eda-Palomares and F.J. Gonz\u00e1lez-Casta\u00f1o, Incomplete projection algorithms for solving the convex feasibility problem, Numer. Algorithms 18 (1998) 177\u2013193.","journal-title":"Numer. Algorithms"},{"key":"9010_CR36","volume-title":"Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings","author":"K. Goebel","year":"1984","unstructured":"K. Goebel, and S. Reich, Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings (Marcel Dekker, New York, 1984)."},{"key":"9010_CR37","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526152","volume-title":"Topics in Metric Fixed Point Theory","author":"K. Goebel","year":"1990","unstructured":"K. Goebel, and W.A. Kirk, Topics in Metric Fixed Point Theory (Cambridge University Press, Cambridge, 1990)."},{"key":"9010_CR38","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/83.913584","volume":"10","author":"F.J. Gonz\u00e1lez-Casta\u00f1o","year":"2001","unstructured":"F.J. Gonz\u00e1lez-Casta\u00f1o, U.M. Garc\u00eda-Palomares, J.L. Alba-Castro and J.M. Pousada-Carballo, Fast image recovery using dynamic load balancing in parallel architectures, by means of incomplete projections, IEEE Trans. Image Process. 10 (2001) 493\u2013499.","journal-title":"IEEE Trans. Image Process."},{"key":"9010_CR39","volume-title":"Variational Methods in Partially Ordered Spaces","author":"A. G\u00f6pfert","year":"2003","unstructured":"A. G\u00f6pfert, H. Riahi, C. Tammer and C. Za\u0103linescu, Variational Methods in Partially Ordered Spaces (Springer, Berlin Heidelberg New York, 2003)."},{"key":"9010_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"L.G. Gubin","year":"1967","unstructured":"L.G. Gubin, B.T. Polyak and E.V. Raik, The method of projections for finding the common point of convex sets, USSR Comput. Math. Math. Phys. 7 (1967) 1\u201324.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9010_CR41","first-page":"355","volume":"A35","author":"S. Kaczmarz","year":"1937","unstructured":"S. Kaczmarz, Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen, Bull. Acad. Sci. Pologne A35 (1937) 355\u2013357.","journal-title":"Bull. Acad. Sci. Pologne"},{"key":"9010_CR42","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0024-3795(93)00089-I","volume":"215","author":"K.C. Kiwiel","year":"1995","unstructured":"K.C. Kiwiel, Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra Appl. 215 (1995) 225\u2013259.","journal-title":"Linear Algebra Appl."},{"key":"9010_CR43","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/S1052623495279569","volume":"7","author":"K.C. Kiwiel","year":"1997","unstructured":"K.C. Kiwiel and B. opuch, Surrogate projection methods for finding fixed points of firmly nonexpansive mappings, SIAM J. Optim. 7 (1997) 1084\u20131102.","journal-title":"SIAM J. Optim."},{"key":"9010_CR44","first-page":"29","volume":"6","author":"N. Lehdili","year":"1999","unstructured":"N. Lehdili and B. Lemaire, The barycentric proximal method, Comm. Appl. Nonlinear Anal. 6 (1999) 29\u201347.","journal-title":"Comm. Appl. Nonlinear Anal."},{"key":"9010_CR45","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/0041-5553(63)90463-4","volume":"2","author":"Y.I. Merzlyakov","year":"1963","unstructured":"Y.I. Merzlyakov, On a relaxation method of solving systems of linear inequalities, USSR Comput. Math. Math. Phys. 2 (1963) 504\u2013510.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9010_CR46","first-page":"215","volume":"22","author":"W. Oettli","year":"1997","unstructured":"W. Oettli, A remark on vector-valued equilibria and generalized monotonicity, Acta Math. Vietnam. 22 (1997) 215\u2013221.","journal-title":"Acta Math. Vietnam."},{"key":"9010_CR47","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF00939552","volume":"56","author":"N. Ottavy","year":"1988","unstructured":"N. Ottavy, Strong convergence of projection-like methods in Hilbert spaces, J. Optim. Theory Appl. 56 (1988) 433\u2013461.","journal-title":"J. Optim. Theory Appl."},{"key":"9010_CR48","doi-asserted-by":"crossref","unstructured":"G. Pierra, \u00c9clatement de contraintes en parall\u00e8le pour la minimisation d\u2019une forme quadratique, in: Lecture Notes in Computer Science, Vol. 41, (Springer, Berlin Heidelberg New York, 1976) pp. 200\u2013218.","DOI":"10.1007\/3-540-07623-9_288"},{"key":"9010_CR49","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G. Pierra","year":"1984","unstructured":"G. Pierra, Decomposition through formalization in a product space, Math. Programming 28 (1984) 96\u2013115.","journal-title":"Math. Program."},{"key":"9010_CR50","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"B.T. Polyak, Minimization of unsmooth functionals, USSR Comput. Math. Math. Phys. 9 (1969) 14\u201329.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9010_CR51","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1080\/03081088308817526","volume":"13","author":"S. Reich","year":"1983","unstructured":"S. Reich, A limit theorem for projections, Linear Multilinear Algebra 13 (1983) 281\u2013290.","journal-title":"Linear Multilinear Algebra"},{"key":"9010_CR52","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877\u2013898.","journal-title":"SIAM J. Control Optim."},{"key":"9010_CR53","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0802021","volume":"2","author":"P. Tseng","year":"1992","unstructured":"P. Tseng, On the convergence of products of firmly nonexpansive mappings, SIAM J. Optim. 2 (1992) 425\u2013434.","journal-title":"SIAM J. Optim."},{"key":"9010_CR54","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/78.995065","volume":"50","author":"I. Yamada","year":"2002","unstructured":"I. Yamada, K. Slavakis and K. Yamada, An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniques, IEEE Trans. Signal Process. 50 (2002) 1091\u20131101.","journal-title":"IEEE Trans. Signal Process."},{"key":"9010_CR55","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1081\/NFA-200045806","volume":"25","author":"I. Yamada","year":"2004","unstructured":"I. Yamada and N. Ogura, Adaptive projected subgradient method for asymptotic minimization of sequence of nonnegative convex functions, Numer. Funct. Anal. Optim. 25 (2004) 593\u2013617.","journal-title":"Numer. Funct. Anal. Optim."},{"key":"9010_CR56","volume-title":"Nonlinear Functional Analysis and Its Applications II\/B \u2013 Nonlinear Monotone Operators","author":"E. Zeidler","year":"1990","unstructured":"E. Zeidler, Nonlinear Functional Analysis and Its Applications II\/B \u2013 Nonlinear Monotone Operators (Springer, Berlin Heidelberg New York, 1990)."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-9010-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-005-9010-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-005-9010-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T01:29:43Z","timestamp":1683336583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-005-9010-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,30]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["9010"],"URL":"https:\/\/doi.org\/10.1007\/s11075-005-9010-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,30]]}}}