{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:20:38Z","timestamp":1754486438199,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T00:00:00Z","timestamp":1661385600000},"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":["s 304392\/2018-9","429915\/2018-7"],"award-info":[{"award-number":["s 304392\/2018-9","429915\/2018-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11590-022-01923-4","type":"journal-article","created":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T09:04:32Z","timestamp":1661418272000},"page":"1069-1081","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Circumcentric directions of cones"],"prefix":"10.1007","volume":"17","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-0003-1670-5075","authenticated-orcid":false,"given":"Hugo","family":"Lara-Urdaneta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-0881","authenticated-orcid":false,"given":"Harry","family":"Oviedo","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":[[2022,8,25]]},"reference":[{"issue":"1","key":"1923_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00186-019-00691-9","volume":"9","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R., Tam, M.K.: The Douglas-Rachford algorithm for convex and nonconvex feasibility problems. Math. Meth. Oper. Res. 9(1), 201\u2013240 (2020). https:\/\/doi.org\/10.1007\/s00186-019-00691-9","journal-title":"Math. Meth. Oper. Res."},{"key":"1923_CR2","unstructured":"Ara\u00fajo, G.H.M.: Circumcentering outer-approximate projections and reflections for the convex feasibility problem. Master\u2019s thesis, EMAp\/Funda\u00e7\u00e3o Get\u00falio Vargas, Rio de Janeiro, BR (2021)"},{"issue":"1","key":"1923_CR3","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 for Sci. Eng. (1), 30 (2022). https:\/\/doi.org\/10.1186\/s13663-021-00711-6","journal-title":"Fixed Point Theory Algorithms for Sci. Eng."},{"key":"1923_CR4","unstructured":"Arefidamghani, R.: Circumcentered-Reflection methods for the Convex Feasibility problem and the Common Fixed-Point problem for firmly nonexpansive operators. Ph.D. thesis, IMPA, Rio de Janeiro (2022)"},{"issue":"2","key":"1923_CR5","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, J.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","journal-title":"Comput. Optim. Appl."},{"key":"1923_CR6","unstructured":"Arefidamghani, R., Behling, R., Iusem, A.N., Santos, L.R.: A circumcentered-reflection method for finding common fixed points of firmly nonexpansive operators. Journal of Applied and Numerical Optimization p. (to appear) (2022)"},{"issue":"2","key":"1923_CR7","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)","journal-title":"Linear Nonlinear Anal."},{"issue":"8","key":"1923_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10013-020-00417-z","volume":"4","author":"HH Bauschke","year":"2020","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: Circumcentered methods induced by isometries. Vietnam J. Math. 4(8), 471\u2013508 (2020). https:\/\/doi.org\/10.1007\/s10013-020-00417-z","journal-title":"Vietnam J. Math."},{"key":"1923_CR9","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","journal-title":"Math. Program."},{"issue":"2","key":"1923_CR10","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 Function. Anal. 6(2), 257\u2013288 (2021)","journal-title":"Pure Appl Function. Anal."},{"issue":"7","key":"1923_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11075-020-00966-x","volume":"8","author":"HH Bauschke","year":"2021","unstructured":"Bauschke, H.H., Ouyang, H., Wang, X.: On the linear convergence of circumcentered isometry methods. Numer Algor 8(7), 263\u2013297 (2021). https:\/\/doi.org\/10.1007\/s11075-020-00966-x","journal-title":"Numer Algor"},{"key":"1923_CR12","doi-asserted-by":"crossref","unstructured":"Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows, fourth edn. Wiley, New York (2009). 10.1002\/9780471703778","DOI":"10.1002\/9780471703778"},{"issue":"3","key":"1923_CR13","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, J.Y., Santos, L.R.: Circumcentering the Douglas-Rachford method. Numer Algor. 78(3), 759\u2013776 (2018). https:\/\/doi.org\/10.1007\/s11075-017-0399-5","journal-title":"Numer Algor."},{"issue":"2","key":"1923_CR14","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, J.Y., Santos, L.R.: On the linear convergence of the circumcentered-reflection method. Operat. Res. Letter. 46(2), 159\u2013162 (2018). https:\/\/doi.org\/10.1016\/j.orl.2017.11.018","journal-title":"Operat. Res. Letter."},{"issue":"3","key":"1923_CR15","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, J.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","journal-title":"Comput. Optim. Appl."},{"key":"1923_CR16","unstructured":"Behling, R., Bello-Cruz, Y., Iusem, A.N., Santos, L.R.: On the centralization of the circumcentered-reflection method. arXiv:2111.07022 [math] (2021)"},{"issue":"4","key":"1923_CR17","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. Optimizat. 31(4), 2863\u20132892 (2021). https:\/\/doi.org\/10.1137\/20M1358669","journal-title":"SIAM J. Optimizat."},{"issue":"6","key":"1923_CR18","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1007\/s11075-020-00941-6","volume":"8","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 8(6), 1475\u20131494 (2021). https:\/\/doi.org\/10.1007\/s11075-020-00941-6","journal-title":"Numer. Algorithms"},{"key":"1923_CR19","volume-title":"Nonlinear Program.","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Program., 2nd edn. Athena Scientific, Belmont, USA (1999)","edition":"2"},{"key":"1923_CR20","volume-title":"Convex Anal. Optimizat.","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P., Nedi\u0107, A., Ozdaglar, A.E.: Convex Anal. Optimizat., 1st edn. Athena Scientific, Belmont, USA (2003)","edition":"1"},{"key":"1923_CR21","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific Series in Optimization and Neural Computation. Athena Scientific, Belmont, Mass (1997)"},{"key":"1923_CR22","doi-asserted-by":"crossref","unstructured":"Dizon, N., Hogan, J., Lindstrom, S. (2022) Circumcentered reflections method for wavelet feasibility problems. ANZIAMJ. 62, C98\u2013C111 . 10.21914\/anziamj.v62.16118","DOI":"10.21914\/anziamj.v62.16118"},{"key":"1923_CR23","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":"1923_CR24","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C. (2001) Fundamentals of Convex Analysis. Springer, Berlin, Heidelberg . 10.1007\/978-3-642-56468-0","DOI":"10.1007\/978-3-642-56468-0"},{"key":"1923_CR25","unstructured":"Lindstrom, S.B.: Computable Centering Methods for Spiraling Algorithms and their Duals, with Motivations from the theory of Lyapunov Functions. arXiv:2001.10784 (2020)"},{"key":"1923_CR26","unstructured":"Ouyang, H.: Circumcenter operators in Hilbert spaces. Master\u2019s thesis, University of British Columbia, Okanagan, CA (2018). 10.14288\/1.0371095"},{"key":"1923_CR27","unstructured":"Ouyang, H.: Finite convergence of locally proper circumcentered methods. arXiv:2011.13512 [math] (2020)"},{"key":"1923_CR28","doi-asserted-by":"crossref","unstructured":"Ouyang, H.: Bregman circumcenters: Applications. arXiv:2105.02308 [math] (2021)","DOI":"10.1007\/s10957-021-01937-5"},{"key":"1923_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-022-01881-x","author":"H Ouyang","year":"2022","unstructured":"Ouyang, H.: Bregman circumcenters: Monotonicity and forward weak convergence. Optim Lett (2022). https:\/\/doi.org\/10.1007\/s11590-022-01881-x","journal-title":"Optim Lett"},{"issue":"1","key":"1923_CR30","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","journal-title":"J. Optim. Theory. Appl."},{"key":"1923_CR31","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, second edn. No. 317 in Grundlehren Der Mathematischen Wissenschaften. Springer, Berlin (2004)"},{"issue":"2","key":"1923_CR32","first-page":"180","volume":"2","author":"M Studen\u00fd","year":"1993","unstructured":"Studen\u00fd, M.: Convex cones in finite-dimensional real vector spaces. Kybernetika. 2(2), 180\u2013200 (1993)","journal-title":"Kybernetika."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01923-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01923-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01923-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T13:19:38Z","timestamp":1681305578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01923-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,25]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1923"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01923-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,8,25]]},"assertion":[{"value":"16 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}