{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:20:16Z","timestamp":1776122416851,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304392\/2018-9"],"award-info":[{"award-number":["304392\/2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["429915\/2018-7"],"award-info":[{"award-number":["429915\/2018-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["113190\/2022-0"],"award-info":[{"award-number":["113190\/2022-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2307328"],"award-info":[{"award-number":["2307328"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e1 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/201.345\/2021"],"award-info":[{"award-number":["E-26\/201.345\/2021"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10589-023-00516-w","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T08:02:41Z","timestamp":1691740961000},"page":"83-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A successive centralized circumcentered-reflection method for the convex feasibility problem"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5473-4654","authenticated-orcid":false,"given":"Roger","family":"Behling","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7877-5688","authenticated-orcid":false,"given":"Yunier","family":"Bello-Cruz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5748-2501","authenticated-orcid":false,"given":"Alfredo","family":"Iusem","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0146-0055","authenticated-orcid":false,"given":"Di","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0083-5871","authenticated-orcid":false,"given":"Luiz-Rafael","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"516_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S1076-5670(08)70157-5","volume-title":"Advances in Imaging and Electron Physics","author":"PL Combettes","year":"1996","unstructured":"Combettes, P.L.: The convex feasibility problem in image recovery. In: Hawkes, P.W. (ed.) Advances in Imaging and Electron Physics, pp. 155\u2013270. Elsevier, San Diego (1996). https:\/\/doi.org\/10.1016\/S1076-5670(08)70157-5"},{"issue":"2","key":"516_CR2","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/140993090","volume":"26","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Li, C., Yang, X.: On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J. Optim. 26(2), 1207\u20131235 (2016). https:\/\/doi.org\/10.1137\/140993090","journal-title":"SIAM J. Optim."},{"issue":"5","key":"516_CR3","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aa6699","volume":"33","author":"J Wang","year":"2017","unstructured":"Wang, J., Hu, Y., Li, C., Yao, J.-C.: Linear convergence of CQ algorithms and applications in gene regulatory network inference. Inverse Prob. 33(5), 055017 (2017). https:\/\/doi.org\/10.1088\/1361-6420\/aa6699","journal-title":"Inverse Prob."},{"issue":"3","key":"516_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(3), 367\u2013426 (1996). https:\/\/doi.org\/10.1137\/S0036144593251710","journal-title":"SIAM Rev."},{"key":"516_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0024-3795(85)90280-0","volume":"64","author":"AR De Pierro","year":"1985","unstructured":"De Pierro, A.R., Iusem, A.N.: A simultaneous projections method for linear inequalities. Linear Algebra Appl. 64, 243\u2013253 (1985). https:\/\/doi.org\/10.1016\/0024-3795(85)90280-0","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"516_CR6","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s11075-017-0399-5","volume":"78","author":"R Behling","year":"2018","unstructured":"Behling, R., Bello-Cruz, Y., Santos, L.-R.: Circumcentering the Douglas\u2013Rachford method. Numer. Algor. 78(3), 759\u2013776 (2018). https:\/\/doi.org\/10.1007\/s11075-017-0399-5. arXiv:1704.06737","journal-title":"Numer. Algor."},{"issue":"2","key":"516_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H., Jr.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82(2), 421\u2013421 (1956). https:\/\/doi.org\/10.1090\/S0002-9947-1956-0084194-4","journal-title":"Trans. Am. Math. Soc."},{"key":"516_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.jat.2014.06.002","volume":"185","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Bello-Cruz, J.-Y., Nghia, T.T.A., Phan, H.M., Wang, X.: The rate of linear convergence of the Douglas\u2013Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J. Approx. Theory 185, 63\u201379 (2014). https:\/\/doi.org\/10.1016\/j.jat.2014.06.002","journal-title":"J. Approx. Theory"},{"issue":"2","key":"516_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01027691","volume":"1","author":"HH Bauschke","year":"1993","unstructured":"Bauschke, H.H., Borwein, J.M.: On the convergence of von Neumann\u2019s alternating projection algorithm for two sets. Set-Valued Anal. 1(2), 185\u2013212 (1993). https:\/\/doi.org\/10.1007\/BF01027691","journal-title":"Set-Valued Anal."},{"issue":"1","key":"516_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11075-015-0085-4","volume":"73","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Bello-Cruz, J.-Y., Nghia, T.T.A., Phan, H.M., Wang, X.: Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas\u2013Rachford methods for two subspaces. Numer. Algorithms 73(1), 33\u201376 (2016). https:\/\/doi.org\/10.1007\/s11075-015-0085-4","journal-title":"Numer. Algorithms"},{"issue":"2","key":"516_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.orl.2017.11.018","volume":"46","author":"R Behling","year":"2018","unstructured":"Behling, R., Bello-Cruz, Y., Santos, L.-R.: On the linear convergence of the circumcentered-reflection method. Oper. Res. Lett. 46(2), 159\u2013162 (2018). https:\/\/doi.org\/10.1016\/j.orl.2017.11.018. arXiv:1711.08651","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"516_CR12","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10589-019-00155-0","volume":"76","author":"R Behling","year":"2020","unstructured":"Behling, R., Bello-Cruz, Y., Santos, L.-R.: The block-wise circumcentered-reflection method. Comput. Optim. Appl. 76(3), 675\u2013699 (2020). https:\/\/doi.org\/10.1007\/s10589-019-00155-0. arXiv:1902.10866","journal-title":"Comput. Optim. Appl."},{"key":"516_CR13","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1007\/s11075-020-00941-6","volume":"86","author":"R Behling","year":"2021","unstructured":"Behling, R., Bello-Cruz, Y., Santos, L.-R.: On the Circumcentered-Reflection Method for the Convex Feasibility Problem. Numer. Algorithms 86, 1475\u20131494 (2021). https:\/\/doi.org\/10.1007\/s11075-020-00941-6. arXiv:2001.01773","journal-title":"Numer. Algorithms"},{"key":"516_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01978-w","author":"R Behling","year":"2023","unstructured":"Behling, R., Bello-Cruz, Y., Iusem, A.N., Santos, L.-R.: On the centralization of the circumcentered-reflection method. Math. Programm. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01978-w. arxiv:2111.07022","journal-title":"Math. Programm."},{"key":"516_CR15","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s11590-022-01923-4","volume":"17","author":"R Behling","year":"2023","unstructured":"Behling, R., Bello-Cruz, Y., Lara-Urdaneta, H., Oviedo, H., Santos, L.-R.: Circumcentric directions of cones. Optim. Lett. 17, 1069\u20131081 (2023). https:\/\/doi.org\/10.1007\/s11590-022-01923-4. arxiv:2112.08314","journal-title":"Optim. Lett."},{"issue":"1","key":"516_CR16","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1186\/s13663-021-00711-6","volume":"2022","author":"GHM Ara\u00fajo","year":"2022","unstructured":"Ara\u00fajo, G.H.M., Arefidamghani, R., Behling, R., Bello-Cruz, Y., Iusem, A., Santos, L.-R.: Circumcentering approximate reflections for solving the convex feasibility problem. Fixed Point Theory Algorithms Sci. Eng. 2022(1), 30 (2022). https:\/\/doi.org\/10.1186\/s13663-021-00711-6. arXiv:2105.00497","journal-title":"Fixed Point Theory Algorithms Sci. Eng."},{"issue":"2","key":"516_CR17","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10589-021-00275-6","volume":"79","author":"R Arefidamghani","year":"2021","unstructured":"Arefidamghani, R., Behling, R., Bello-Cruz, Y., Iusem, A.N., Santos, L.-R.: The circumcentered-reflection method achieves better rates than alternating projections. Comput. Optim. Appl. 79(2), 507\u2013530 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00275-6. arXiv:2007.14466","journal-title":"Comput. Optim. Appl."},{"key":"516_CR18","unstructured":"Arefidamghani, R., Behling, R., Iusem, A.N., Santos, L.-R.: A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators. J. Appl. Numer. Optim. (to appear) (2023) arXiv:2203.02410"},{"issue":"2","key":"516_CR19","first-page":"271","volume":"4","author":"HH Bauschke","year":"2018","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On circumcenters of finite sets in Hilbert spaces. Linear Nonlinear Anal. 4(2), 271\u2013295 (2018). arXiv:1807.02093","journal-title":"Linear Nonlinear Anal."},{"key":"516_CR20","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10013-020-00417-z","volume":"48","author":"HH Bauschke","year":"2020","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: Circumcentered methods induced by isometries. Vietnam J. Math. 48, 471\u2013508 (2020). https:\/\/doi.org\/10.1007\/s10013-020-00417-z. arXiv:1908.11576","journal-title":"Vietnam J. Math."},{"key":"516_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01718-y","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: Best approximation mappings in Hilbert spaces. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01718-y. arXiv:2006.02644","journal-title":"Math. Program."},{"issue":"2","key":"516_CR22","first-page":"257","volume":"6","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On circumcenter mappings induced by nonexpansive operators. Pure Appl. Funct. Anal. 6(2), 257\u2013288 (2021). arXiv:1811.11420","journal-title":"Pure Appl. Funct. Anal."},{"key":"516_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11075-020-00966-x","volume":"87","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On the linear convergence of circumcentered isometry methods. Numer. Algor. 87, 263\u2013297 (2021). https:\/\/doi.org\/10.1007\/s11075-020-00966-x. arXiv:1912.01063","journal-title":"Numer. Algor."},{"key":"516_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-021-00626-9","author":"ND Dizon","year":"2022","unstructured":"Dizon, N.D., Hogan, J.A., Lindstrom, S.B.: Circumcentering reflection methods for nonconvex feasibility problems. Set-Valued Var. Anal (2022). https:\/\/doi.org\/10.1007\/s11228-021-00626-9","journal-title":"Set-Valued Var. Anal"},{"key":"516_CR25","doi-asserted-by":"publisher","first-page":"98","DOI":"10.21914\/anziamj.v62.16118","volume":"62","author":"N Dizon","year":"2022","unstructured":"Dizon, N., Hogan, J., Lindstrom, S.: Circumcentered reflections method for wavelet feasibility problems. ANZIAMJ 62, 98\u2013111 (2022). https:\/\/doi.org\/10.21914\/anziamj.v62.16118. arXiv:2005.05687","journal-title":"ANZIAMJ"},{"issue":"3","key":"516_CR26","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1007\/s10589-022-00413-8","volume":"83","author":"SB Lindstrom","year":"2022","unstructured":"Lindstrom, S.B.: Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions. Comput. Optim. Appl. 83(3), 999\u20131026 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00413-8. arXiv:2001.10784","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"516_CR27","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/s10957-021-01937-5","volume":"191","author":"H Ouyang","year":"2021","unstructured":"Ouyang, H., Wang, X.: Bregman circumcenters: basic theory. J. Optim. Theory Appl. 191(1), 252\u2013280 (2021). https:\/\/doi.org\/10.1007\/s10957-021-01937-5. arXiv:2104.03234","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"516_CR28","first-page":"857","volume":"29","author":"H Ouyang","year":"2022","unstructured":"Ouyang, H.: Finite convergence of locally proper circumcentered methods. J. Convex Anal. 29(3), 857\u2013892 (2022). arXiv:2011.13512","journal-title":"J. Convex Anal."},{"key":"516_CR29","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s11590-022-01881-x","volume":"17","author":"H Ouyang","year":"2023","unstructured":"Ouyang, H.: Bregman circumcenters: monotonicity and forward weak convergence. Optim. Lett. 17, 121\u2013141 (2023). https:\/\/doi.org\/10.1007\/s11590-022-01881-x. arxiv:2105.02308","journal-title":"Optim. Lett."},{"key":"516_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00186-019-00691-9","volume":"91","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R., Tam, M.K.: The Douglas\u2013Rachford algorithm for convex and nonconvex feasibility problems. Math. Meth. Oper. Res. 91, 201\u2013240 (2020). https:\/\/doi.org\/10.1007\/s00186-019-00691-9","journal-title":"Math. Meth. Oper. Res."},{"issue":"1","key":"516_CR31","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra, G.: Decomposition through formalization in a product space. Math. Program. 28(1), 96\u2013115 (1984). https:\/\/doi.org\/10.1007\/BF02612715","journal-title":"Math. Program."},{"issue":"6","key":"516_CR32","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1512\/iumj.1977.26.26090","volume":"26","author":"SF McCormick","year":"1977","unstructured":"McCormick, S.F.: The Methods of Kaczmarz and row orthogonalization for solving linear equations and least squares problems in Hilbert space. Indiana Univ. Math. J. 26(6), 1137\u20131150 (1977)","journal-title":"Indiana Univ. Math. J."},{"issue":"4","key":"516_CR33","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 Rev. 23(4), 444\u2013466 (1981). https:\/\/doi.org\/10.1137\/1023097","journal-title":"SIAM Rev."},{"issue":"10","key":"516_CR34","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1016\/0898-1221(85)90019-7","volume":"11","author":"JM Mart\u00ednez","year":"1985","unstructured":"Mart\u00ednez, J.M.: The projection method for solving nonlinear systems of equations under the \u201cmost violated constraint\u2019\u2019 control. Comput. Math. Appl. 11(10), 987\u2013993 (1985). https:\/\/doi.org\/10.1016\/0898-1221(85)90019-7","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"516_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-013-0381-x","volume":"160","author":"JM Borwein","year":"2014","unstructured":"Borwein, J.M., Tam, M.K.: A cyclic Douglas\u2013Rachford iteration scheme. J. Optim. Theory Appl. 160(1), 1\u201329 (2014). https:\/\/doi.org\/10.1007\/s10957-013-0381-x","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"516_CR36","first-page":"573","volume":"16","author":"JM Borwein","year":"2015","unstructured":"Borwein, J.M., Tam, M.K.: The cyclic Douglas\u2013Rachford method for inconsistent feasibility problems. J. Nonlinear Convex Anal. 16(4), 573\u2013584 (2015). arXiv:1310.2195","journal-title":"J. Nonlinear Convex Anal."},{"key":"516_CR37","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. CMS Books in Mathematics. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","DOI":"10.1007\/978-3-319-48311-5"},{"key":"516_CR38","doi-asserted-by":"crossref","unstructured":"Borwein, J.M., Vanderwerff, J.D.: Convex Functions: Constructions, Characterizations and Counterexamples. Encyclopedia of mathematics and its applications, vol. 109. Cambridge University Press, Cambridge(2010)","DOI":"10.1017\/CBO9781139087322"},{"issue":"2","key":"516_CR39","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-4068(74)90011-1","volume":"1","author":"LL Wegge","year":"1974","unstructured":"Wegge, L.L.: Mean value theorem for convex functions. J. Math. Econ. 1(2), 207\u2013208 (1974). https:\/\/doi.org\/10.1016\/0304-4068(74)90011-1","journal-title":"J. Math. Econ."},{"key":"516_CR40","unstructured":"Rockafellar, R.T.: Convex Analysis, 10th edn. Princeton Landmarks in Mathematics and Physics. Princeton Univ. Press, Princeton (1997)"},{"issue":"2","key":"516_CR41","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/moor.8.2.315","volume":"8","author":"L Qi","year":"1983","unstructured":"Qi, L.: Complete closedness of maximal monotone operators. Math. OR 8(2), 315\u2013317 (1983). https:\/\/doi.org\/10.1287\/moor.8.2.315","journal-title":"Math. OR"},{"issue":"4","key":"516_CR42","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1080\/10556780310001604977","volume":"18","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems. Optim. Methods Softw. 18(4), 377\u2013394 (2003). https:\/\/doi.org\/10.1080\/10556780310001604977","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"516_CR43","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"HH Bauschke","year":"1999","unstructured":"Bauschke, H.H., Borwein, J.M., Li, W.: Strong conical hull intersection property, bounded linear regularity, Jameson\u2019s property (G), and error bounds in convex optimization. Math. Program. 86(1), 135\u2013160 (1999). https:\/\/doi.org\/10.1007\/s101070050083","journal-title":"Math. Program."},{"issue":"4","key":"516_CR44","doi-asserted-by":"publisher","first-page":"2863","DOI":"10.1137\/20M1358669","volume":"31","author":"R Behling","year":"2021","unstructured":"Behling, R., Bello-Cruz, Y., Santos, L.-R.: Infeasibility and error bound imply finite convergence of alternating projections. SIAM J. Optim. 31(4), 2863\u20132892 (2021). https:\/\/doi.org\/10.1137\/20M1358669. arXiv:2008.03354","journal-title":"SIAM J. Optim."},{"key":"516_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-022-09586-4","author":"T Liu","year":"2022","unstructured":"Liu, T., Louren\u00e7o, B.F.: Convergence analysis under consistent error bounds. Found. Comput. Math. (2022). https:\/\/doi.org\/10.1007\/s10208-022-09586-4","journal-title":"Found. Comput. Math."},{"issue":"1","key":"516_CR46","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-016-1039-x","volume":"168","author":"AY Kruger","year":"2018","unstructured":"Kruger, A.Y., Luke, D.R., Thao, N.H.: Set regularities and feasibility problems. Math. Program. 168(1), 279\u2013311 (2018). https:\/\/doi.org\/10.1007\/s10107-016-1039-x","journal-title":"Math. Program."},{"key":"516_CR47","doi-asserted-by":"crossref","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of nonlinear equations in several variables, 1st edn. Classics in Applied Mathematics. SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719468"},{"key":"516_CR48","doi-asserted-by":"publisher","DOI":"10.1201\/9780429494147","volume-title":"Analysis on Manifolds","author":"JR Munkres","year":"1997","unstructured":"Munkres, J.R.: Analysis on Manifolds, 1st edn. CRC Press, Boca Raton (1997). https:\/\/doi.org\/10.1201\/9780429494147","edition":"1"},{"issue":"1","key":"516_CR49","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017). https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev."},{"key":"516_CR50","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.cam.2017.01.008","volume":"319","author":"Z Jia","year":"2017","unstructured":"Jia, Z., Cai, X., Han, D.: Comparison of several fast algorithms for projection onto an ellipsoid. J. Comput. Appl. Math. 319, 320\u2013337 (2017). https:\/\/doi.org\/10.1016\/j.cam.2017.01.008","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"516_CR51","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00516-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00516-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00516-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T12:06:53Z","timestamp":1704370013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00516-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00516-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,11]]},"assertion":[{"value":"25 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"We certify that all authors are complying with the journal\u2019s ethical policies and that this manuscript has not been published or submitted simultaneously for publication elsewhere.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}