{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:54:36Z","timestamp":1773809676781,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"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":["Found Comput Math"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10208-022-09586-4","type":"journal-article","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T20:32:50Z","timestamp":1666125170000},"page":"429-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Convergence Analysis under Consistent Error Bounds"],"prefix":"10.1007","volume":"24","author":[{"given":"Tianxiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno F.","family":"Louren\u00e7o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"9586_CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"S.\u00a0Agmon, The relaxation method for linear inequalities, Canad. J. Math. 6 (1954), 382\u2013392.","journal-title":"Canad. J. Math."},{"key":"9586_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0024-3795(89)90375-3","volume":"120","author":"R Aharoni","year":"1989","unstructured":"R.\u00a0Aharoni and Y.\u00a0Censor, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra Appl. 120 (1989), 165 \u2013 175.","journal-title":"Linear Algebra Appl."},{"key":"9586_CR3","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"H.\u00a0Attouch, J.\u00a0Bolte, P.\u00a0Redont, and A.\u00a0Soubeyran, Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality, Math. Oper. Res. 35 (2010), 438\u2013457.","journal-title":"Math. Oper. Res."},{"key":"9586_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"H.\u00a0Attouch, J.\u00a0Bolte, and B.\u00a0F. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods, Math. Program. 137 (2013), 91\u2013129.","journal-title":"Math. Program."},{"key":"9586_CR5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.jfa.2011.09.002","volume":"262","author":"J-B Baillon","year":"2012","unstructured":"J.-B. Baillon, P.\u00a0Combettes, and R.\u00a0Cominetti, There is no variational characterization of the cycles in the method of periodic projections, J. Funct. Anal. 262 (2012), 400 \u2013 408.","journal-title":"J. Funct. Anal."},{"key":"9586_CR6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"H.\u00a0H. Bauschke and J.\u00a0M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Review 38 (1996), 367\u2013426.","journal-title":"SIAM Review"},{"key":"9586_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s101070050083","volume":"86","author":"HH Bauschke","year":"1999","unstructured":"H.\u00a0H. Bauschke, J.\u00a0M. Borwein, and W.\u00a0Li, Strong conical hull intersection property, bounded linear regularity, Jameson\u2019s property (G), and error bounds in convex optimization, Math. Program. 86 (1999), 135\u2013160.","journal-title":"Math. Program."},{"key":"9586_CR8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/10556780310001604977","volume":"18","author":"A Beck","year":"2003","unstructured":"A.\u00a0Beck and M.\u00a0Teboulle, Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems, Optim. Methods Softw. 18 (2003), 377\u2013394.","journal-title":"Optim. Methods Softw."},{"key":"9586_CR9","doi-asserted-by":"crossref","unstructured":"N.\u00a0H. Bingham, C.\u00a0M. Goldie, and E.\u00a0Omey, Regularly varying probability densities, Publ. Inst. Math. (Beograd) (N.S.) 80 (2006), 47\u201357.","DOI":"10.2298\/PIM0694047B"},{"key":"9586_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721434","volume-title":"Regular Variation","author":"NH Bingham","year":"1987","unstructured":"N.\u00a0H. Bingham, C.\u00a0M. Goldie, and J.\u00a0L. Teugels, Regular Variation, Encyclopedia of Mathematics and its Applications, Cambridge University Press, 1987."},{"key":"9586_CR11","doi-asserted-by":"crossref","unstructured":"J.\u00a0Bochnak, M.\u00a0Coste, and M.-F. Roy, Real Algebraic Geometry, Springer Science, 1998.","DOI":"10.1007\/978-3-662-03718-8"},{"key":"9586_CR12","doi-asserted-by":"crossref","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"J.\u00a0Bolte, A.\u00a0Daniilidis, O.\u00a0Ley, and L.\u00a0Mazet, Characterizations of \u0141ojasiewicz inequalities: subgradient flows, talweg, convexity, Trans. Amer. Math. Soc. 362 (2010), 3319\u20133363.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9586_CR13","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"J.\u00a0Bolte, T.\u00a0P. Nguyen, J.\u00a0Peypouquet, and B.\u00a0W. Suter, From error bounds to the complexity of first-order descent methods for convex functions, Math. Program. 165 (2017), 471\u2013507.","journal-title":"Math. Program."},{"key":"9586_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/15M1045223","volume":"27","author":"JM Borwein","year":"2017","unstructured":"J.\u00a0M. Borwein, G.\u00a0Li, and M.\u00a0K. Tam, Convergence rate analysis for averaged fixed point iterations in common fixed point problems, SIAM J. Optim. 27 (2017), 1\u201333.","journal-title":"SIAM J. Optim."},{"key":"9586_CR15","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1137\/130919052","volume":"24","author":"JM Borwein","year":"2014","unstructured":"J.\u00a0M. Borwein, G.\u00a0Li, and L.\u00a0Yao, Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets, SIAM J. Optim. 24 (2014), 498\u2013527.","journal-title":"SIAM J. Optim."},{"key":"9586_CR16","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"JM Borwein","year":"1981","unstructured":"J.\u00a0M. Borwein and H.\u00a0Wolkowicz, Regularizing the abstract convex program, J. Math. Anal. Appl. 83 (1981), 495 \u2013 530.","journal-title":"J. Math. Anal. Appl."},{"key":"9586_CR17","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y Censor","year":"1981","unstructured":"Y.\u00a0Censor, Row-action methods for huge and sparse systems and their applications, SIAM Rev. 23 (1981), 444\u2013466.","journal-title":"SIAM Rev."},{"key":"9586_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-0998-2","volume":"161","author":"V Chandrasekaran","year":"2017","unstructured":"V.\u00a0Chandrasekaran and P.\u00a0Shah, Relative entropy optimization and its applications, Math. Program. 161 (2017), 1\u201332.","journal-title":"Math. Program."},{"key":"9586_CR19","unstructured":"R.\u00a0Chares, Cones and interior-point algorithms for structured convex optimization involving powers and exponentials, Phd thesis, Universit\u00e9 catholique de Louvain (2009)."},{"key":"9586_CR20","unstructured":"C.\u00a0Coey, L.\u00a0Kapelevich, and J.\u00a0P. Vielma, Solving natural conic formulations with Hypatia.jl, ArXiv e-prints arXiv:2005.01136."},{"key":"9586_CR21","doi-asserted-by":"crossref","unstructured":"P.\u00a0L. Combettes, The convex feasibility problem in image recovery, volume\u00a095, 155\u2013270, Elsevier, 1996.","DOI":"10.1016\/S1076-5670(08)70157-5"},{"key":"9586_CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02683333","volume":"35","author":"PL Combettes","year":"1997","unstructured":"P.\u00a0L. Combettes, Hilbertian convex feasibility problem: Convergence of projection methods, Appl. Math. Optim. 35 (1997), 311\u2013330.","journal-title":"Appl. Math. Optim."},{"key":"9586_CR23","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1287\/moor.2016.0827","volume":"42","author":"D Davis","year":"2017","unstructured":"D.\u00a0Davis and W.\u00a0Yin, Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions, Math. Oper. Res. 42 (2017), 783\u2013805.","journal-title":"Math. Oper. Res."},{"key":"9586_CR24","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1016\/j.jmaa.2007.02.039","volume":"335","author":"D Djur\u010di\u0107","year":"2007","unstructured":"D.\u00a0Djur\u010di\u0107 and A.\u00a0Torga\u0161ev, Some asymptotic relations for the generalized inverse, J. Math. Anal. Appl. 335 (2007), 1397\u20131402.","journal-title":"J. Math. Anal. Appl."},{"key":"9586_CR25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"J.\u00a0Douglas and H.\u00a0H. Rachford, On the numerical solution of heat conduction problems in two and three space variables, Trans. Amer. Math. Soc. 82 (1956), 421\u2013439.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9586_CR26","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10107-016-1048-9","volume":"162","author":"D Drusvyatskiy","year":"2017","unstructured":"D.\u00a0Drusvyatskiy, G.\u00a0Li, and H.\u00a0Wolkowicz, A note on alternating projections for ill-posed semidefinite feasibility problems, Math. Program. 162 (2017), 537\u2013548.","journal-title":"Math. Program."},{"key":"9586_CR27","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s00186-013-0436-7","volume":"77","author":"P Embrechts","year":"2013","unstructured":"P.\u00a0Embrechts and M.\u00a0Hofert, A note on generalized inverses, Math. Methods Oper. Res. 77 (2013), 423\u2013432.","journal-title":"Math. Methods Oper. Res."},{"key":"9586_CR28","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"J Faraut","year":"1994","unstructured":"J.\u00a0Faraut and A.\u00a0Kor\u00e1nyi, Analysis on Symmetric Cones, Oxford Mathematical Monographs, Clarendon Press, Oxford, 1994."},{"key":"9586_CR29","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/02331930701523510","volume":"57","author":"L Faybusovich","year":"2008","unstructured":"L.\u00a0Faybusovich, Several Jordan-algebraic aspects of optimization, Optimization 57 (2008), 379\u2013393.","journal-title":"Optimization"},{"key":"9586_CR30","unstructured":"H.\u00a0A. Friberg, Projection onto the exponential cone: a univariate root-finding problem, Optimization Online, Jan. 2021."},{"key":"9586_CR31","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-5193(72)90180-4","volume":"36","author":"P Gilbert","year":"1972","unstructured":"P.\u00a0Gilbert, Iterative methods for the three-dimensional reconstruction of an object from projections, J. Theoret. Biol. 36 (1972), 105\u2013117.","journal-title":"J. Theoret. Biol."},{"key":"9586_CR32","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/10556780903191165","volume":"26","author":"D Henrion","year":"2011","unstructured":"D.\u00a0Henrion and J.\u00a0Malick, Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions, Optim. Methods Softw. 26 (2011), 23\u201346.","journal-title":"Optim. Methods Softw."},{"key":"9586_CR33","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/359340.359351","volume":"21","author":"GT Herman","year":"1978","unstructured":"G.\u00a0T. Herman, A.\u00a0Lent, and P.\u00a0H. Lutz, Relaxation methods for image reconstruction, Comm. ACM 21 (1978), 152\u2013158.","journal-title":"Comm. ACM"},{"key":"9586_CR34","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.laa.2017.06.043","volume":"532","author":"M Ito","year":"2017","unstructured":"M.\u00a0Ito and B.\u00a0F. Louren\u00e7o, A bound on the Carath\u00e9odory number, Linear Algebra Appl. 532 (2017), 347 \u2013 363.","journal-title":"Linear Algebra Appl."},{"key":"9586_CR35","unstructured":"M.\u00a0Karimi and L.\u00a0Tun\u00e7el, Domain-Driven Solver (DDS) Version 2.0: a MATLAB-based software package for convex optimization problems in domain-driven form, ArXiv e-prints arXiv:1908.03075."},{"key":"9586_CR36","volume-title":"The Minnesota notes on Jordan algebras and their applications, number 1710 in Lecture Notes in Mathematics","author":"M Koecher","year":"1999","unstructured":"M.\u00a0Koecher, The Minnesota notes on Jordan algebras and their applications, number 1710 in Lecture Notes in Mathematics, Springer, Berlin, 1999."},{"key":"9586_CR37","doi-asserted-by":"crossref","unstructured":"A.\u00a0S. Lewis and J.-S. Pang, Error bounds for convex inequality systems, in Generalized Convexity, Generalized Monotonicity: Recent Results (J.-P. Crouzeix, J.-E. Martinez-Legaz, and M.\u00a0Volle, eds.) , Springer US, 1998, pp. 75\u2013110.","DOI":"10.1007\/978-1-4613-3341-8_3"},{"key":"9586_CR38","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-015-0963-5","volume":"159","author":"G Li","year":"2016","unstructured":"G.\u00a0Li and T.\u00a0K. Pong, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, Math. Program. 159 (2016), 371\u2013401.","journal-title":"Math. Program."},{"key":"9586_CR39","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","volume":"18","author":"G Li","year":"2018","unstructured":"G.\u00a0Li and T.\u00a0K. Pong, Calculus of the exponent of Kurdyka\u2013\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods, Found. Comput. Math. 18 (2018), 1199\u20131232.","journal-title":"Found. Comput. Math."},{"key":"9586_CR40","unstructured":"S.\u00a0B. Lindstrom, B.\u00a0F. Louren\u00e7o, and T.\u00a0K. Pong, Error bounds, facial residual functions and applications to the exponential cone, Math. Program. (accepted)."},{"key":"9586_CR41","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"P.\u00a0L. Lions and B.\u00a0Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Anal. 16 (1979), 964\u2013979.","journal-title":"SIAM J. Numer. Anal."},{"key":"9586_CR42","doi-asserted-by":"crossref","first-page":"S66","DOI":"10.1137\/16M1073807","volume":"39","author":"JD Loera","year":"2017","unstructured":"J.\u00a0D. Loera, J.\u00a0Haddock, and D.\u00a0Needell, A sampling Kaczmarz-Motzkin algorithm for linear feasibility, SIAM J. Sci. Comput. 39 (2017), S66\u2013S87.","journal-title":"SIAM J. Sci. Comput."},{"key":"9586_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-019-01439-3","volume":"186","author":"BF Louren\u00e7o","year":"2021","unstructured":"B.\u00a0F. Louren\u00e7o, Amenable cones: error bounds without constraint qualifications, Math. Program. 186 (2021), 1\u201348.","journal-title":"Math. Program."},{"key":"9586_CR44","doi-asserted-by":"crossref","first-page":"2304","DOI":"10.1137\/15M1051634","volume":"28","author":"BF Louren\u00e7o","year":"2018","unstructured":"B.\u00a0F. Louren\u00e7o, M.\u00a0Muramatsu, and T.\u00a0Tsuchiya, Facial reduction and partial polyhedrality, SIAM J. Optim. 28 (2018), 2304\u20132326.","journal-title":"SIAM J. Optim."},{"key":"9586_CR45","doi-asserted-by":"crossref","unstructured":"M.\u00a0Lubin, E.\u00a0Yamangil, R.\u00a0Bent, and J.\u00a0P. Vielma, Extended formulations in mixed-integer convex programming, in Lecture Notes in Computer Science 9682 (Q.\u00a0Louveaux and M.\u00a0Skutella, eds.), IPCO, 2016, pp.\u00a0102\u2013113.","DOI":"10.1007\/978-3-319-33461-5_9"},{"key":"9586_CR46","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z Luo","year":"1993","unstructured":"Z.\u00a0Luo and P.\u00a0Tseng, Error bounds and convergence analysis of feasible descent methods: a general approach, Ann. Oper. Res. 46 (1993), 157\u2013178.","journal-title":"Ann. Oper. Res."},{"key":"9586_CR47","unstructured":"MOSEK ApS, MOSEK Modeling Cookbook Release 3.2.3 (2021), https:\/\/docs.mosek.com\/modeling-cookbook\/index.html."},{"key":"9586_CR48","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"T.\u00a0S. Motzkin and I.\u00a0J. Schoenberg, The relaxation method for linear inequalities, Canad. J. Math. 6 (1954), 393\u2013404.","journal-title":"Canad. J. Math."},{"key":"9586_CR49","doi-asserted-by":"crossref","first-page":"2814","DOI":"10.1137\/18M1167061","volume":"29","author":"I Necoara","year":"2019","unstructured":"I.\u00a0Necoara, P.\u00a0Richt\u00e1rik, and A.\u00a0Patrascu, Randomized projection methods for convex feasibility: conditioning and convergence rates, SIAM J. Optim. 29 (2019), 2814\u20132852.","journal-title":"SIAM J. Optim."},{"key":"9586_CR50","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/17M1124085","volume":"29","author":"P Ochs","year":"2019","unstructured":"P.\u00a0Ochs, Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano, SIAM J. Optim. 29 (2019), 541\u2013570.","journal-title":"SIAM J. Optim."},{"key":"9586_CR51","first-page":"299","volume":"79","author":"J-S Pang","year":"1997","unstructured":"J.-S. Pang, Error bounds in mathematical programming, Math. Program. 79 (1997), 299\u2013332.","journal-title":"Math. Program."},{"key":"9586_CR52","unstructured":"D.\u00a0Papp and S.\u00a0Y\u0131ld\u0131z, alfonso: Matlab package for nonsymmetric conic optimization, ArXiv e-prints arXiv:2101.04274."},{"key":"9586_CR53","first-page":"613","volume-title":"Strong duality in conic linear programming: facial reduction and extended duals, in Computational and Analytical Mathematics","author":"G Pataki","year":"2013","unstructured":"G.\u00a0Pataki, Strong duality in conic linear programming: facial reduction and extended duals, in Computational and Analytical Mathematics, volume\u00a050, Springer New York, 2013, pp. 613\u2013634."},{"key":"9586_CR54","unstructured":"R.\u00a0T. Rockafellar, Convex Analysis, Princeton University Press, 1997."},{"key":"9586_CR55","doi-asserted-by":"crossref","unstructured":"E.\u00a0Seneta, Regularly Varying Functions, Lecture Notes in Mathematics, Springer Berlin Heidelberg, 1976.","DOI":"10.1007\/BFb0079658"},{"key":"9586_CR56","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1137\/S1052623498338606","volume":"10","author":"JF Sturm","year":"2000","unstructured":"J.\u00a0F. Sturm, Error bounds for linear matrix inequalities, SIAM J. Optim. 10 (2000), 1228\u20131248.","journal-title":"SIAM J. Optim."},{"key":"9586_CR57","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/s10957-012-0219-y","volume":"158","author":"H Waki","year":"2013","unstructured":"H.\u00a0Waki and M.\u00a0Muramatsu, Facial reduction algorithms for conic optimization problems, J. Optim. Theory Appl. 158 (2013), 188\u2013215.","journal-title":"J. Optim. Theory Appl."},{"key":"9586_CR58","doi-asserted-by":"publisher","unstructured":"X.\u00a0Wang and Z.\u00a0Wang, The exact modulus of the generalized concave Kurdyka-\u0141ojasiewicz property, Math. Oper. Res. https:\/\/doi.org\/10.1287\/moor.2021.1227","DOI":"10.1287\/moor.2021.1227"},{"key":"9586_CR59","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TMI.1982.4307555","volume":"1","author":"DC Youla","year":"1982","unstructured":"D.\u00a0C. Youla and H.\u00a0Webb, Image restoration by the method of convex projections: Part 1-theory, IEEE Trans. Med. Imaging 1 (1982), 81\u201394.","journal-title":"IEEE Trans. Med. Imaging"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-022-09586-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-022-09586-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-022-09586-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:04:55Z","timestamp":1713290695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-022-09586-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["9586"],"URL":"https:\/\/doi.org\/10.1007\/s10208-022-09586-4","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,18]]},"assertion":[{"value":"8 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}