{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:32Z","timestamp":1740142472230,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:00:00Z","timestamp":1667865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T00:00:00Z","timestamp":1667865600000},"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":["11971480","61977065"],"award-info":[{"award-number":["11971480","61977065"]}],"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":"the 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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s40314-022-02105-9","type":"journal-article","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T20:11:45Z","timestamp":1667938305000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A weighted randomized sparse Kaczmarz method for solving linear systems"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4712-2921","authenticated-orcid":false,"given":"Lu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ziyang","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Hongxia","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,8]]},"reference":[{"issue":"4","key":"2105_CR1","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1137\/21M1398562","volume":"14","author":"X Chen","year":"2021","unstructured":"Chen X, Qin J (2021) Regularized Kaczmarz algorithms for tensor recovery. SIAM J Imaging Sci 14(4):1439\u20131471. https:\/\/doi.org\/10.1137\/21M1398562","journal-title":"SIAM J Imaging Sci"},{"issue":"1","key":"2105_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129\u2013159. https:\/\/doi.org\/10.1137\/S003614450037906X","journal-title":"SIAM Rev"},{"issue":"1","key":"2105_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis TA, Hu Y (2011) The university of Florida sparse matrix collection. ACM Trans Math Softw (TOMS) 38(1):1\u201325. https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"2105_CR4","unstructured":"Du K, Sun XH (2021) Randomized regularized extended Kaczmarz algorithms for tensor recovery. Preprint arXiv:2112.08566"},{"key":"2105_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representations: from theory to applications in signal and image processing","author":"M Elad","year":"2010","unstructured":"Elad M (2010) Sparse and redundant representations: from theory to applications in signal and image processing. Springer, London. https:\/\/doi.org\/10.1007\/978-1-4419-7011-4"},{"key":"2105_CR6","doi-asserted-by":"publisher","unstructured":"Feichtinger HG, Cenker C, Mayer M et\u00a0al (1992) New variants of the POCS method using affine subspaces of finite codimension with applications to irregular sampling. In: Visual communications and image processing\u201992, pp 299\u2013310. https:\/\/doi.org\/10.1117\/12.131447","DOI":"10.1117\/12.131447"},{"key":"2105_CR7","unstructured":"Gro\u00df J (2021) A note on the randomized Kaczmarz method with a partially weighted selection step. Preprint arXiv:2105.14583"},{"key":"2105_CR8","unstructured":"Jiang Y, Wu G, Jiang L (2020) A Kaczmarz method with simple random sampling for solving large linear systems. Preprint arXiv:2011.14693"},{"key":"2105_CR9","first-page":"355","volume":"1","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz S (1937) Angen\u00e4herte aufl\u00f6sung von systemen linearer glei-chungen. Bull Int Acad Pol Sic Let Cl Sci Math Nat 1:355\u2013357","journal-title":"Bull Int Acad Pol Sic Let Cl Sci Math Nat"},{"issue":"6","key":"2105_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-022-01978-0","volume":"41","author":"RR Li","year":"2022","unstructured":"Li RR, Liu H (2022) On randomized partial block Kaczmarz method for solving huge linear algebraic systems. Comput Appl Math 41(6):1\u201310. https:\/\/doi.org\/10.1007\/s40314-022-01978-0","journal-title":"Comput Appl Math"},{"key":"2105_CR11","doi-asserted-by":"publisher","unstructured":"Lorenz DA, Wenger S, Sch\u00f6pfer F et\u00a0al (2014a) 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. https:\/\/doi.org\/10.1109\/ICIP.2014.7025269","DOI":"10.1109\/ICIP.2014.7025269"},{"key":"2105_CR12","doi-asserted-by":"publisher","unstructured":"Lorenz DA, Sch\u00f6pfer F, Wenger S (2014b) The linearized Bregman method via split feasibility problems: analysis and generalizations. SIAM J Imaging Sci 7(2):1237\u20131262. https:\/\/doi.org\/10.1137\/130936269","DOI":"10.1137\/130936269"},{"issue":"2","key":"2105_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10543-010-0265-5","volume":"50","author":"D Needell","year":"2010","unstructured":"Needell D (2010) Randomized Kaczmarz solver for noisy linear systems. BIT Numer Math 50(2):395\u2013403. https:\/\/doi.org\/10.1007\/s10543-010-0265-5","journal-title":"BIT Numer Math"},{"key":"2105_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization: a basic course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov Y (2003) Introductory lectures on convex optimization: a basic course, vol 87. Springer, London. https:\/\/doi.org\/10.1007\/978-1-4419-8853-9"},{"key":"2105_CR15","unstructured":"Patel V, Jahangoshahi M, Maldonado DA (2021) Convergence of adaptive, randomized, iterative linear solvers. Preprint arXiv:2104.04816"},{"issue":"3","key":"2105_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1515\/auom-2015-0052","volume":"23","author":"S Petra","year":"2015","unstructured":"Petra S (2015) Randomized sparse block Kaczmarz as randomized dual block-coordinate descent. Anal Univ Ovidius Const Ser Mat 23(3):129\u2013149. https:\/\/doi.org\/10.1515\/auom-2015-0052","journal-title":"Anal Univ Ovidius Const Ser Mat"},{"key":"2105_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63416-2_683","volume-title":"Variational analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar RT, Wets RJB (2009) Variational analysis, vol 317. Springer, London. https:\/\/doi.org\/10.1007\/978-3-030-63416-2_683"},{"issue":"4","key":"2105_CR18","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1137\/11085236X","volume":"22","author":"F Sch\u00f6pfer","year":"2012","unstructured":"Sch\u00f6pfer F (2012) Exact regularization of polyhedral norms. SIAM J Optim 22(4):1206\u20131223. https:\/\/doi.org\/10.1137\/11085236X","journal-title":"SIAM J Optim"},{"issue":"1","key":"2105_CR19","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 DA (2019) Linear convergence of the randomized sparse Kaczmarz method. Math Program 173(1):509\u2013536. https:\/\/doi.org\/10.1007\/s10107-017-1229-1","journal-title":"Math Program"},{"issue":"332","key":"2105_CR20","doi-asserted-by":"publisher","first-page":"2815","DOI":"10.1090\/mcom\/3644","volume":"90","author":"S Steinerberger","year":"2021","unstructured":"Steinerberger S (2021) A weighted randomized Kaczmarz method for solving linear systems. Math Comput 90(332):2815\u20132826. https:\/\/doi.org\/10.1090\/mcom\/3644","journal-title":"Math Comput"},{"issue":"2","key":"2105_CR21","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 (2009) A randomized Kaczmarz algorithm with exponential convergence. J Fourier Anal Appl 15(2):262\u2013278. https:\/\/doi.org\/10.1007\/s00041-008-9030-4","journal-title":"J Fourier Anal Appl"},{"issue":"1","key":"2105_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/imaiai\/iay005","volume":"8","author":"YS Tan","year":"2019","unstructured":"Tan YS, Vershynin R (2019) Phase retrieval via randomized Kaczmarz: theoretical guarantees. Inf Infer J IMA 8(1):97\u2013123. https:\/\/doi.org\/10.1093\/imaiai\/iay005","journal-title":"Inf Infer J IMA"},{"key":"2105_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114856","author":"X Wang","year":"2022","unstructured":"Wang X, Che M, Mo C et al (2022) Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method. J Comput Appl Math. https:\/\/doi.org\/10.1016\/j.cam.2022.114856","journal-title":"J Comput Appl Math"},{"key":"2105_CR24","doi-asserted-by":"publisher","unstructured":"Yuan ZY, Zhang H, Wang H (2022a) Sparse sampling Kaczmarz\u2013Motzkin method with linear convergence. Math Methods Appl Sci 45(7):3463\u20133478. https:\/\/doi.org\/10.1002\/mma.7990","DOI":"10.1002\/mma.7990"},{"key":"2105_CR25","doi-asserted-by":"publisher","unstructured":"Yuan ZY, Zhang L, Wang H et al (2022b) Adaptively sketched Bregman projection methods for linear systems. Inverse Prob 38(6):065,005. https:\/\/doi.org\/10.1088\/1361-6420\/ac5f76","DOI":"10.1088\/1361-6420\/ac5f76"},{"issue":"2","key":"2105_CR26","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/120889897","volume":"34","author":"A Zouzias","year":"2013","unstructured":"Zouzias A, Freris NM (2013) Randomized extended Kaczmarz for solving least squares. SIAM J Matrix Anal Appl 34(2):773\u2013793. https:\/\/doi.org\/10.1137\/120889897","journal-title":"SIAM J Matrix Anal Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02105-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-02105-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02105-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T10:18:00Z","timestamp":1670926680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-02105-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,8]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2105"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-02105-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2022,11,8]]},"assertion":[{"value":"24 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"383"}}