{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T05:41:24Z","timestamp":1772862084486,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T00:00:00Z","timestamp":1739577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T00:00:00Z","timestamp":1739577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61931025, 42374156"],"award-info":[{"award-number":["61931025, 42374156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s11075-025-02027-7","type":"journal-article","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T02:00:53Z","timestamp":1739584853000},"page":"915-931","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On stochastic block methods for solving nonlinear equations"],"prefix":"10.1007","volume":"101","author":[{"given":"Wendi","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,15]]},"reference":[{"key":"2027_CR1","doi-asserted-by":"publisher","unstructured":"Kaltenbacher, B., Neubauer, A., Scherzer, O.: Iterative Regularization Methods for Nonlinear Ill-Posed Problems. De Gruyter, Berlin, New York (2008). https:\/\/doi.org\/10.1515\/9783110208276.181","DOI":"10.1515\/9783110208276.181"},{"issue":"1","key":"2027_CR2","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10107-015-0864-7","volume":"155","author":"D Needell","year":"2016","unstructured":"Needell, D., Srebro, N., Ward, R.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Math. Program. 155(1), 549\u2013573 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0864-7","journal-title":"Math. Program."},{"issue":"2","key":"2027_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012). https:\/\/doi.org\/10.1137\/100802001","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2027_CR4","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013). https:\/\/doi.org\/10.1137\/120887679","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2027_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0892-3","journal-title":"Math. Program."},{"issue":"1","key":"2027_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/16M1060182","volume":"27","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Stich, S.U.: Efficiency of the accelerated coordinate descent method on structured optimization problems. SIAM Journal on Optimization 27(1), 110\u2013123 (2017). https:\/\/doi.org\/10.1137\/16M1060182","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2027_CR7","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1137\/19M1271798","volume":"30","author":"B Jin","year":"2020","unstructured":"Jin, B., Zhou, Z., Zou, J.: On the convergence of stochastic gradient descent for nonlinear ill-posed problems. SIAM J. Optim. 30(2), 1421\u20131450 (2020). https:\/\/doi.org\/10.1137\/19M1271798","journal-title":"SIAM J. Optim."},{"key":"2027_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2020.106739","volume":"112","author":"W Hao","year":"2021","unstructured":"Hao, W.: A gradient descent method for solving a system of nonlinear equations. Appl. Math. Lett. 112, 106739 (2021). https:\/\/doi.org\/10.1016\/j.aml.2020.106739","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"2027_CR9","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1137\/21M139788X","volume":"32","author":"R Yuan","year":"2022","unstructured":"Yuan, R., Lazaric, A., Gower, R.M.: Sketched Newton-Raphson. SIAM J. Optim. 32(3), 1555\u20131583 (2022). https:\/\/doi.org\/10.1137\/21M139788X","journal-title":"SIAM J. Optim."},{"key":"2027_CR10","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.amc.2021.126373","volume":"408","author":"K Du","year":"2021","unstructured":"Du, K., Sun, X.: A doubly stochastic block Gauss-Seidel algorithm for solving linear equations. Appl. Math. Comput. 408, 1263\u20131282 (2021). https:\/\/doi.org\/10.1016\/j.amc.2021.126373","journal-title":"Appl. Math. Comput."},{"key":"2027_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.113720","volume":"399","author":"Q Wang","year":"2022","unstructured":"Wang, Q., Li, W., Bao, W., Gao, X.: Nonlinear Kaczmarz algorithms and their convergence. J Comput Appl Math 399, 113720 (2022)","journal-title":"J Comput Appl Math"},{"issue":"2","key":"2027_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.3934\/ipi.2007.1.289","volume":"1","author":"M Haltmeier","year":"2007","unstructured":"Haltmeier, M., Leitao, A., Scherzer, O.: Kaczmarz methods for regularizing nonlinear ill-posed equations I: convergence analysis. Inverse Probl. Imaging 1(2), 289\u2013298 (2007). https:\/\/doi.org\/10.3934\/ipi.2007.1.289","journal-title":"Inverse Probl. Imaging"},{"issue":"126","key":"2027_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s40314-023-02265-2","volume":"42","author":"F Zhang","year":"2023","unstructured":"Zhang, F., Bao, W., Li, W., Wang, Q.: On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems. Appl. Math. Comput. 42(126), 43\u201358 (2023). https:\/\/doi.org\/10.1007\/s40314-023-02265-2","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"2027_CR14","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013). https:\/\/doi.org\/10.1137\/120887679","journal-title":"SIAM J. Optim."},{"key":"2027_CR15","doi-asserted-by":"publisher","unstructured":"Luksan, L., Vl\u010dek, J., Matonoha, C.: Problems for Nonlinear Least Squares and Nonlinear Equations vol. 1259. Institute of Computer Science, Academy of Sciences of the Czech Republic, Czech Republic (2018). https:\/\/doi.org\/10.13140\/RG.2.2.16112.10248","DOI":"10.13140\/RG.2.2.16112.10248"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02027-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T08:08:29Z","timestamp":1770624509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02027-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,15]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2027"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02027-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,15]]},"assertion":[{"value":"12 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}