{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T03:17:09Z","timestamp":1786159029865,"version":"build-2736575974"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:00:00Z","timestamp":1731715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:00:00Z","timestamp":1731715200000},"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":["11971354"],"award-info":[{"award-number":["11971354"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016804","name":"Natural Science Foundation of Shenzhen Municipality","doi-asserted-by":"publisher","award":["20220809161224001"],"award-info":[{"award-number":["20220809161224001"]}],"id":[{"id":"10.13039\/100016804","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10915-024-02737-5","type":"journal-article","created":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T18:06:25Z","timestamp":1731780385000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Surrogate Hyperplane Bregman\u2013Kaczmarz Method for Solving Linear Inverse Problems"],"prefix":"10.1007","volume":"102","author":[{"given":"Zeyu","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ze","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guojian","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun-Feng","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,16]]},"reference":[{"issue":"1","key":"2737_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS-B Chen","year":"2001","unstructured":"Chen, S.S.-B., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"4","key":"2737_CR2","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"268","key":"2737_CR3","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1090\/S0025-5718-09-02242-X","volume":"78","author":"J-F Cai","year":"2009","unstructured":"Cai, J.-F., Osher, S., Shen, Z.-W.: Convergence of the linearized Bregman iteration for $$\\ell _1$$-norm minimization. Math. Comput. 78(268), 2127\u20132136 (2009)","journal-title":"Math. Comput."},{"issue":"267","key":"2737_CR4","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1090\/S0025-5718-08-02189-3","volume":"78","author":"J-F Cai","year":"2009","unstructured":"Cai, J.-F., Osher, S., Shen, Z.-W.: Linearized Bregman iterations for compressed sensing. Math. Comput. 78(267), 1515\u20131536 (2009)","journal-title":"Math. Comput."},{"issue":"1","key":"2737_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W-T Yin","year":"2008","unstructured":"Yin, W.-T., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for $$\\ell _1$$-minimization with applications to compressed sensing. SIAM J. Imag. Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imag. Sci."},{"key":"2737_CR6","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.: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Springer Science & Business Media, Berlin (2010)"},{"issue":"1","key":"2737_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2019.2950557","volume":"37","author":"D Liang","year":"2020","unstructured":"Liang, D., Cheng, J., Ke, Z.-W., Ying, L.: Deep magnetic resonance image reconstruction: inverse problems meet neural networks. IEEE Signal Process. Mag. 37(1), 141\u2013151 (2020)","journal-title":"IEEE Signal Process. Mag."},{"issue":"12","key":"2737_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aa9581","volume":"33","author":"J Adler","year":"2017","unstructured":"Adler, J., \u00d6ktem, O.: Solving ill-posed inverse problems using iterative deep neural networks. Inverse Prob. 33(12), 124007 (2017)","journal-title":"Inverse Prob."},{"key":"2737_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492919000059","volume":"28","author":"S Arridge","year":"2019","unstructured":"Arridge, S., Maass, P., \u00d6ktem, O., Sch\u00f6nlieb, C.B.: Solving inverse problems using data-driven models. Acta Numer. 28, 1\u2013174 (2019)","journal-title":"Acta Numer."},{"key":"2737_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492918000016","volume":"27","author":"M Benning","year":"2018","unstructured":"Benning, M., Burger, M.: Modern regularization methods for inverse problems. Acta Numer. 27, 1\u2013111 (2018)","journal-title":"Acta Numer."},{"key":"2737_CR11","first-page":"335","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen\u00e4herte aufl\u00f6sung von systemen linearer gleichungen. Bull. Int. Acad. Pol. Sci. Lett. 35, 335\u2013357 (1937)","journal-title":"Bull. Int. Acad. Pol. Sci. Lett."},{"issue":"2","key":"2737_CR12","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)","journal-title":"J. Fourier Anal. Appl."},{"key":"2737_CR13","doi-asserted-by":"crossref","unstructured":"Tondji, L., Lorenz, D.\u00a0A., Necoara, I.: An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization, in: Proceedings of the 2023 European Control Conference (ECC), IEEE, pp 1\u20136, (2023)","DOI":"10.23919\/ECC57647.2023.10178390"},{"key":"2737_CR14","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, 509\u2013536 (2019)","journal-title":"Math. Program."},{"key":"2737_CR15","doi-asserted-by":"crossref","unstructured":"Lorenz, D.\u00a0A., Wenger, S., Sch\u00f6pfer, F., Magnor, M.: A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing, in: Proceedings of the 2014 IEEE International Conference on Image Processing (ICIP), pp 1347\u20131351, (2014)","DOI":"10.1109\/ICIP.2014.7025269"},{"issue":"9","key":"2737_CR16","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ad5fb1","volume":"40","author":"L Tondji","year":"2024","unstructured":"Tondji, L., Tondji, I., Lorenz, D.A.: Adaptive Bregman-Kaczmarz: an approach to solve linear inverse problems with independent noise exactly. Inverse Prob. 40(9), 095006 (2024)","journal-title":"Inverse Prob."},{"key":"2737_CR17","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.laa.2024.07.009","volume":"699","author":"L Tondji","year":"2024","unstructured":"Tondji, L., Necoara, I., Lorenz, D.A.: Acceleration and restart for the randomized Bregman-Kaczmarz method. Linear Algebra Appl. 699, 508\u2013538 (2024)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2737_CR18","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/130936269","volume":"7","author":"DA Lorenz","year":"2014","unstructured":"Lorenz, D.A., Sch\u00f6pfer, F., Wenger, S.: The linearized Bregman method via split feasibility problems: analysis and generalizations. SIAM J. Imag. Sci. 7(2), 1237\u20131262 (2014)","journal-title":"SIAM J. Imag. Sci."},{"issue":"3","key":"2737_CR19","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. Analele \u015etiin\u0163ifice ale Univ. Ovidius Constan\u0163a Seria Matematic\u0103 23(3), 129\u2013149 (2015)","journal-title":"Analele \u015etiin\u0163ifice ale Univ. Ovidius Constan\u0163a Seria Matematic\u0103"},{"issue":"8","key":"2737_CR20","doi-asserted-by":"publisher","first-page":"383","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), 383 (2022)","journal-title":"Comput. Appl. Math."},{"issue":"6","key":"2737_CR21","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ac5f76","volume":"38","author":"Z-Y Yuan","year":"2022","unstructured":"Yuan, Z.-Y., Zhang, L., Wang, H.-X., Zhang, H.: Adaptively sketched Bregman projection methods for linear systems. Inverse Prob. 38(6), 065005 (2022)","journal-title":"Inverse Prob."},{"issue":"4","key":"2737_CR22","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)","journal-title":"Numer. Algorithms"},{"key":"2737_CR23","unstructured":"Lorenz, D.\u00a0A., Winkler, M.: Minimal error momentum Bregman-Kaczmarz. arXiv preprint arXiv:2307.15435, (2023)"},{"key":"2737_CR24","unstructured":"Yun, Z., Han, D., Su, Y.-S., Xie, J.-X.: Fast stochastic dual coordinate descent algorithms for linearly constrained convex optimization. arXiv preprint arXiv:2307.16702, (2023)"},{"key":"2737_CR25","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/22M148803X","volume":"44","author":"NF Marshall","year":"2023","unstructured":"Marshall, N.F., Mickelin, O.: An optimal scheduled learning rate for a randomized Kaczmarz algorithm. SIAM J. Matrix Anal. Appl. 44, 312\u2013330 (2023)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2737_CR26","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.\u00a0T., Wets, R.\u00a0J.\u00a0B.: Variational analysis springer, MR1491362, (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"issue":"3","key":"2737_CR27","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2737_CR28","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.laa.2022.07.003","volume":"652","author":"F Sch\u00f6pfer","year":"2022","unstructured":"Sch\u00f6pfer, F., Lorenz, D.A., Tondji, L., Winkler, M.: Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems. Linear Algebra Appl. 652, 132\u2013154 (2022)","journal-title":"Linear Algebra Appl."},{"key":"2737_CR29","doi-asserted-by":"crossref","unstructured":"Greub, W., Rheinboldt, W.: On a generalization of an inequality of L. V. Kantorovich, in: Proceedings of the American Mathematical Society, vol. 10, pp 407\u2013415, (1959)","DOI":"10.1090\/S0002-9939-1959-0105028-3"},{"key":"2737_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.116182","volume":"454","author":"Z Wang","year":"2025","unstructured":"Wang, Z., Yin, J.-F., Zhao, J.-C.: The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem. J. Comput. Appl. Math. 454, 116182 (2025)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02737-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02737-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02737-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T14:59:54Z","timestamp":1736780394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02737-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,16]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2737"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02737-5","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,16]]},"assertion":[{"value":"5 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2024","order":4,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"7"}}