{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:01:55Z","timestamp":1770998515876,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977065,11971480"],"award-info":[{"award-number":["61977065,11971480"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Fund of Hunan for Excellent Youth","award":["2020JJ3038"],"award-info":[{"award-number":["2020JJ3038"]}]},{"name":"Fund for NUDT Young Innovator Awards","award":["20190105"],"award-info":[{"award-number":["20190105"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s11075-024-01844-6","type":"journal-article","created":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:02:00Z","timestamp":1715590920000},"page":"1575-1610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems"],"prefix":"10.1007","volume":"98","author":[{"given":"Lu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hongxia","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"1844_CR1","doi-asserted-by":"publisher","unstructured":"Lorenz, D.A., Wenger, S., Sch\u00f6pfer, F., Magnor, M.: A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing. In: 2014 IEEE International Conference on Image Processing (ICIP), pp. 1347\u20131351 (2014). https:\/\/doi.org\/10.1109\/ICIP.2014.7025269. IEEE","DOI":"10.1109\/ICIP.2014.7025269"},{"issue":"1","key":"1844_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/imaiai\/iay005","volume":"8","author":"YS Tan","year":"2019","unstructured":"Tan, Y.S., Vershynin, R.: Phase retrieval via randomized Kaczmarz: theoretical guarantees. Inf. Inference: J. IMA 8(1), 97\u2013123 (2019). https:\/\/doi.org\/10.1093\/imaiai\/iay005","journal-title":"Inf. Inference: J. IMA"},{"key":"1844_CR3","doi-asserted-by":"publisher","unstructured":"Xian, Y., Liu, H.G., Tai, X.C., Wang, Y.: Randomized Kaczmarz Method for Single-Particle X-Ray Image Phase Retrieval[M]\/\/Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging: Mathematical Imaging and Vision. Cham: Springer International Publishing, pp. 1\u201316 (2022). https:\/\/doi.org\/10.1007\/978-3-030-98661-2112","DOI":"10.1007\/978-3-030-98661-2112"},{"key":"1844_CR4","doi-asserted-by":"publisher","unstructured":"R\u00f6mer, P., Filbir, F., Krahmer, F.: On the randomized Kaczmarz algorithm for phase retrieval. In: 2021 55th Asilomar Conference on Signals, Systems, and Computers, pp. 847\u2013851 (2021). https:\/\/doi.org\/10.1109\/IEEECONF53345.2021.9723291. IEEE","DOI":"10.1109\/IEEECONF53345.2021.9723291"},{"issue":"4","key":"1844_CR5","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1137\/21M1398562","volume":"14","author":"X Chen","year":"2021","unstructured":"Chen, X., Qin, J.: Regularized Kaczmarz algorithms for tensor recovery. SIAM J. Imaging Sci. 14(4), 1439\u20131471 (2021). https:\/\/doi.org\/10.1137\/21M1398562","journal-title":"SIAM J. Imaging Sci."},{"key":"1844_CR6","unstructured":"Du, K., Sun, X.H.: Randomized regularized extended Kaczmarz algorithms for tensor recovery. Preprint at arXiv:2112.08566 (2021)"},{"issue":"3","key":"1844_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0022-5193(70)90109-8","volume":"29","author":"R Gordon","year":"1970","unstructured":"Gordon, R., Bender, R., Herman, G.T.: Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and X-ray photography. J. Theor. Biol. 29(3), 471\u2013481 (1970). https:\/\/doi.org\/10.1016\/0022-5193(70)90109-8","journal-title":"J. Theor. Biol."},{"key":"1844_CR8","doi-asserted-by":"publisher","unstructured":"Jarman, B., Needell, D.: QuantileRK: Solving large-scale linear systems with corrupted, noisy data. In: 2021 55th Asilomar Conference on Signals, Systems, and Computers, pp. 1312\u20131316 (2021). https:\/\/doi.org\/10.1109\/IEEECONF53345.2021.9723338. IEEE","DOI":"10.1109\/IEEECONF53345.2021.9723338"},{"key":"1844_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10543-010-0265-5","volume":"50","author":"D Needell","year":"2010","unstructured":"Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT Numer. Math. 50, 395\u2013403 (2010). https:\/\/doi.org\/10.1007\/s10543-010-0265-5","journal-title":"BIT Numer. Math."},{"issue":"1","key":"1844_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10107-017-1229-1","volume":"173","author":"F Sch\u00f6pfer","year":"2019","unstructured":"Sch\u00f6pfer, F., Lorenz, D.A.: Linear convergence of the randomized sparse Kaczmarz method. Math. Program. 173(1), 509\u2013536 (2019). https:\/\/doi.org\/10.1007\/s10107-017-1229-1","journal-title":"Math. Program."},{"issue":"7","key":"1844_CR11","doi-asserted-by":"publisher","first-page":"3463","DOI":"10.1002\/mma.7990","volume":"45","author":"ZY Yuan","year":"2022","unstructured":"Yuan, Z.Y., Zhang, H., Wang, H.X.: Sparse sampling Kaczmarz-Motzkin method with linear convergence. Math. Methods Appl. Sci. 45(7), 3463\u20133478 (2022). https:\/\/doi.org\/10.1002\/mma.7990","journal-title":"Math. Methods Appl. Sci."},{"issue":"6","key":"1844_CR12","doi-asserted-by":"publisher","first-page":"065005","DOI":"10.1088\/1361-6420\/ac5f76","volume":"38","author":"ZY Yuan","year":"2022","unstructured":"Yuan, Z.Y., Zhang, L., Wang, H.X., Zhang, H.: Adaptively sketched Bregman projection methods for linear systems. Inverse Probl. 38(6), 065005 (2022). https:\/\/doi.org\/10.1088\/1361-6420\/ac5f76","journal-title":"Inverse Probl."},{"issue":"8","key":"1844_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-022-02105-9","volume":"41","author":"L Zhang","year":"2022","unstructured":"Zhang, L., Yuan, Z.Y., Wang, H.X., Zhang, H.: A weighted randomized sparse Kaczmarz method for solving linear systems. Comput. Appl. Math. 41(8), 1\u201318 (2022). https:\/\/doi.org\/10.1007\/s40314-022-02105-9","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"1844_CR14","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/21M1429187","volume":"43","author":"J Haddock","year":"2022","unstructured":"Haddock, J., Needell, D., Rebrova, E., Swartworth, W.: Quantile-based iterative methods for corrupted systems of linear equations. SIAM J. Matrix Anal. Appl. 43(2), 605\u2013637 (2022). https:\/\/doi.org\/10.1137\/21M1429187","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1844_CR15","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1093\/imaiai\/iaab029","volume":"12","author":"S Steinerberger","year":"2023","unstructured":"Steinerberger, S.: Quantile-based random Kaczmarz for corrupted linear systems of equations. Inf. Inference: J. IMA 12(1), 448\u2013465 (2023). https:\/\/doi.org\/10.1093\/imaiai\/iaab029","journal-title":"Inf. Inference: J. IMA"},{"issue":"4","key":"1844_CR16","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1007\/s11075-022-01473-x","volume":"93","author":"L Tondji","year":"2023","unstructured":"Tondji, L., Lorenz, D.A.: Faster randomized block sparse Kaczmarz by averaging. Numer. Algorithms 93(4), 1417\u20131451 (2023). https:\/\/doi.org\/10.1007\/s11075-022-01473-x","journal-title":"Numer. Algorithms"},{"issue":"3","key":"1844_CR17","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/0041-5553(63)90463-4","volume":"2","author":"YI Merzlyakov","year":"1963","unstructured":"Merzlyakov, Y.I.: On a relaxation method of solving systems of linear inequalities. USSR Comput. Math. and Math. Phys. 2(3), 504\u2013510 (1963). https:\/\/doi.org\/10.1016\/0041-5553(63)90463-4","journal-title":"USSR Comput. Math. and Math. Phys."},{"issue":"4","key":"1844_CR18","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1137\/19M1251643","volume":"40","author":"I Necoara","year":"2019","unstructured":"Necoara, I.: Faster randomized block Kaczmarz algorithms. SIAM J. Matrix Anal. Appl. 40(4), 1425\u20131452 (2019). https:\/\/doi.org\/10.1137\/19M1251643","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1844_CR19","unstructured":"Karczmarz, S.: Angenaherte auflosung von systemen linearer glei-chungen. Bull. Int. Acad. Pol. Sic. Let., Cl. Sci. Math. Nat., 355\u2013357 (1937)"},{"issue":"552","key":"1844_CR20","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1259\/0007-1285-46-552-1016","volume":"46","author":"GN Hounsfield","year":"1973","unstructured":"Hounsfield, G.N.: Computerized transverse axial scanning (tomography): Part 1. description of system. Brit. J. Radiol. 46(552), 1016\u20131022 (1973). https:\/\/doi.org\/10.1259\/0007-1285-46-552-1016","journal-title":"Brit. J. Radiol."},{"key":"1844_CR21","doi-asserted-by":"publisher","unstructured":"Neumann, J.V.: Functional operators, vol. ii. the geometry of orthogonal spaces (this is a reprint of mimeographed lecture notes first distributed in 1933) annals of math. Studies Nr. 22 Princeton Univ. Press (1950). https:\/\/doi.org\/10.1515\/9781400882250","DOI":"10.1515\/9781400882250"},{"issue":"1","key":"1844_CR22","first-page":"96","volume":"23","author":"I Halperin","year":"1962","unstructured":"Halperin, I.: The product of projection operators. Acta Sci. Math. (Szeged) 23(1), 96\u201399 (1962)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"2","key":"1844_CR23","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jmaa.1997.5202","volume":"205","author":"F Deutsch","year":"1997","unstructured":"Deutsch, F., Hundal, H.: The rate of convergence for the method of alternating projections, ii. J. Math. Anal. Appl. 205(2), 381\u2013405 (1997). https:\/\/doi.org\/10.1006\/jmaa.1997.5202","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"1844_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jmaa.2004.12.050","volume":"310","author":"A Gal\u00e1ntai","year":"2005","unstructured":"Gal\u00e1ntai, A.: On the rate of convergence of the alternating projection method in finite dimensional spaces. J. Math. Anal. Appl. 310(1), 30\u201344 (2005). https:\/\/doi.org\/10.1016\/j.jmaa.2004.12.050","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"1844_CR25","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2009","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15(2), 262\u2013278 (2009). https:\/\/doi.org\/10.1007\/s00041-008-9030-4","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"1844_CR26","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/130936269","volume":"7","author":"DA Lorenz","year":"2014","unstructured":"Lorenz, D.A., Schopfer, F., Wenger, S.: The linearized Bregman method via split feasibility problems: analysis and generalizations. SIAM J. Imaging Sci. 7(2), 1237\u20131262 (2014). https:\/\/doi.org\/10.1137\/130936269","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1844_CR27","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001). https:\/\/doi.org\/10.1137\/S003614450037906X","journal-title":"SIAM Rev."},{"issue":"268","key":"1844_CR28","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1090\/S0025-5718-09-02242-X","volume":"78","author":"JF Cai","year":"2009","unstructured":"Cai, J.F., Osher, S., Shen, Z.: Convergence of the linearized Bregman iteration for $$l_1$$-norm minimization. Math. Comput. 78(268), 2127\u20132136 (2009). https:\/\/doi.org\/10.1090\/S0025-5718-09-02242-X","journal-title":"Math. Comput."},{"issue":"3","key":"1844_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1515\/auom-2015-0052","volume":"23","author":"S Petra","year":"2015","unstructured":"Petra, S.: Randomized sparse block Kaczmarz as randomized dual block-coordinate descent. Anal. \u015ftiin. ale Univ. Ovidius Constan\u0163a. Seria Mat. 23(3), 129\u2013149 (2015). https:\/\/doi.org\/10.1515\/auom-2015-0052","journal-title":"Anal. \u015ftiin. ale Univ. Ovidius Constan\u0163a. Seria Mat."},{"key":"1844_CR30","unstructured":"Jiang, Y.T., Wu, G., Jiang, L.: A Kaczmarz method with simple random sampling for solving large linear systems. Preprint at arXiv:2011.14693 (2020)"},{"key":"1844_CR31","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2012.12.022","volume":"441","author":"D Needell","year":"2014","unstructured":"Needell, D., Tropp, J.A.: Paved with good intentions: analysis of a randomized block Kaczmarz method. Linear Algebra Appl. 441, 199\u2013221 (2014). https:\/\/doi.org\/10.1016\/j.laa.2012.12.022","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1844_CR32","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10543-020-00824-1","volume":"61","author":"JD Moorman","year":"2021","unstructured":"Moorman, J.D., Tu, T.K., Molitor, D., Needell, D.: Randomized Kaczmarz with averaging. BIT Numer. Math. 61(1), 337\u2013359 (2021). https:\/\/doi.org\/10.1007\/s10543-020-00824-1","journal-title":"BIT Numer. Math."},{"key":"1844_CR33","doi-asserted-by":"publisher","first-page":"114372","DOI":"10.1016\/j.cam.2022.114372","volume":"413","author":"CQ Miao","year":"2022","unstructured":"Miao, C.Q., Wu, W.T.: On greedy randomized average block Kaczmarz method for solving large linear systems. J. Comput. Appl. Math. 413, 114372 (2022). https:\/\/doi.org\/10.1016\/j.cam.2022.114372","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"1844_CR34","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/090760350","volume":"3","author":"WT Yin","year":"2010","unstructured":"Yin, W.T.: Analysis and generalizations of the linearized bregman method. SIAM J. Imaging Sci 3(4), 856\u2013877 (2010). https:\/\/doi.org\/10.1137\/090760350","journal-title":"SIAM J. Imaging Sci"},{"issue":"5","key":"1844_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1137\/18M1179213","volume":"41","author":"J Haddock","year":"2019","unstructured":"Haddock, J., Needell, D.: Randomized projection methods for linear systems with arbitrarily large sparse corruptions. SIAM J. Sci. Comput. 41(5), 19\u201336 (2019). https:\/\/doi.org\/10.1137\/18M1179213","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1844_CR36","doi-asserted-by":"publisher","first-page":"024002","DOI":"10.1088\/1361-6420\/aca78a","volume":"39","author":"L Cheng","year":"2022","unstructured":"Cheng, L., Jarman, B., Needell, D., Rebrova, E.: On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations. Inverse Probl. 39(2), 024002 (2022). https:\/\/doi.org\/10.1088\/1361-6420\/aca78a","journal-title":"Inverse Probl."},{"key":"1844_CR37","unstructured":"Zhang, L., Wang, H.X., Zhang, H.: Quantile-based random sparse Kaczmarz for corrupted, noisy linear inverse systems. Preprint at arXiv:2206.07356 (2022)"},{"issue":"2","key":"1844_CR38","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s11075-007-9136-9","volume":"46","author":"PC Hansen","year":"2007","unstructured":"Hansen, P.C.: Regularization tools version 4.0 for matlab 7.3. Numer. Algorithms 46(2), 189\u2013194 (2007). https:\/\/doi.org\/10.1007\/s11075-007-9136-9","journal-title":"Numer. Algorithms"},{"issue":"5","key":"1844_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. and Math. Phys. 4(5), 1\u201317 (1964). https:\/\/doi.org\/10.1016\/0041-5553(64)90137-5","journal-title":"USSR Comput. Math. and Math. Phys."},{"key":"1844_CR40","doi-asserted-by":"publisher","unstructured":"Sch\u00f6pfer, F.: Exact regularization of polyhedral norms. SIAM J. Optim. 22(4), 1206\u20131223 (2012). https:\/\/doi.org\/10.1137\/11085236X","DOI":"10.1137\/11085236X"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01844-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01844-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01844-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T08:49:24Z","timestamp":1739350164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01844-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1844"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01844-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"23 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2024","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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}