{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T21:55:30Z","timestamp":1780350930748,"version":"3.54.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T00:00:00Z","timestamp":1679529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Fundamental Research Funds for the Central Universities","award":["18CX02041A"],"award-info":[{"award-number":["18CX02041A"]}]},{"name":"the Shandong Provincial Natural Science Foundation","award":["ZR2020MD060"],"award-info":[{"award-number":["ZR2020MD060"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["42176011"],"award-info":[{"award-number":["42176011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62231028"],"award-info":[{"award-number":["62231028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s40314-023-02265-2","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T19:02:34Z","timestamp":1679598154000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On sampling Kaczmarz\u2013Motzkin methods for solving large-scale nonlinear systems"],"prefix":"10.1007","volume":"42","author":[{"given":"Feiyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wendi","family":"Bao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,23]]},"reference":[{"issue":"3","key":"2265_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke HH, Borwein JM (1996) On projection algorithms for solving convex feasibility problems. SIAM Rev 38(3):367\u2013426. https:\/\/doi.org\/10.1137\/S0036144593251710","journal-title":"SIAM Rev"},{"key":"2265_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41804-5","volume-title":"Convex analysis for optimization: a unified approach","author":"J Brinkhuis","year":"2020","unstructured":"Brinkhuis J (2020) Convex analysis for optimization: a unified approach, 1st edn. Springer Cham, Berlin. https:\/\/doi.org\/10.1007\/978-3-030-41804-5","edition":"1"},{"issue":"1","key":"2265_CR3","first-page":"1","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","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"5","key":"2265_CR4","doi-asserted-by":"publisher","first-page":"S66","DOI":"10.1137\/16M1073807","volume":"39","author":"JA De Loera","year":"2017","unstructured":"De Loera JA, Haddock J, Needell D (2017) A sampling Kaczmarz\u2013Motzkin algorithm for linear feasibility. SIAM J Sci Comput 39(5):S66\u2013S87. https:\/\/doi.org\/10.1137\/16M1073807","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"2265_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JEJ Dennis","year":"1977","unstructured":"Dennis JEJ, Mor\u00e9 JJ (1977) Quasi-Newton methods, motivation and theory. SIAM Rev 19(1):46\u201389. https:\/\/doi.org\/10.1137\/1019005","journal-title":"SIAM Rev"},{"issue":"2","key":"2265_CR6","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 (2007) Kaczmarz methods for regularizing nonlinear ill-posed equations I: convergence analysis. Inverse Probl Imaging 1(2):289\u2013298. https:\/\/doi.org\/10.3934\/ipi.2007.1.289","journal-title":"Inverse Probl Imaging"},{"issue":"2","key":"2265_CR7","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.48550\/arXiv.1907.03132","volume":"30","author":"B Jin","year":"2020","unstructured":"Jin B, Zhou Z, Zou J (2020) On the convergence of stochastic gradient descent for nonlinear ill-posed problems. SIAM J Optim 30(2):1421\u20131450. https:\/\/doi.org\/10.48550\/arXiv.1907.03132","journal-title":"SIAM J Optim"},{"key":"2265_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/cnm.1286","volume-title":"Iterative Methods for Linear and Nonlinear Equations","author":"CT Kelley","year":"1995","unstructured":"Kelley CT (1995) Iterative Methods for Linear and Nonlinear Equations. Society for Industrial and Applied Mathematics, Philadelphia. https:\/\/doi.org\/10.1002\/cnm.1286"},{"issue":"1","key":"2265_CR9","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/S0036142998335704","volume":"37","author":"D Li","year":"1999","unstructured":"Li D, Fukushima M (1999) A globally and superlinearly convergent Gauss-Newton based BFGS method for symmetric nonlinear equations. SIAM J Numer Anal 37(1):152\u2013172. https:\/\/doi.org\/10.1137\/S0036142998335704","journal-title":"SIAM J Numer Anal"},{"key":"2265_CR10","doi-asserted-by":"publisher","unstructured":"Luk\u0161an L, Matonoha C, Vlcek J (2018) Problems for nonlinear least squares and nonlinear equations. Tech. Rep. 1259, Institute of Computer Science, Academy of Sciences of the Czech Republic. https:\/\/doi.org\/10.13140\/RG.2.2.16112.10248","DOI":"10.13140\/RG.2.2.16112.10248"},{"issue":"1","key":"2265_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/LCSYS.2020.3000714","volume":"5","author":"T Qin","year":"2020","unstructured":"Qin T, Etesami SR (2020) A randomized algorithm for generalized accelerated projection method. IEEE Control Syst. Lett. 5(1):85\u201390. https:\/\/doi.org\/10.1109\/LCSYS.2020.3000714","journal-title":"IEEE Control Syst. Lett."},{"key":"2265_CR12","unstructured":"Wang M, Bertsekas DP (2013) Incremental constraint projection-proximal methods for nonsmooth convex optimization. SIAM J Optimiz (to appear)"},{"key":"2265_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cam.2021.113720","volume":"399","author":"Q Wang","year":"2022","unstructured":"Wang Q, Li W, Bao W et al (2022) Nonlinear Kaczmarz algorithms and their convergence. J Comput Appl Math 399:113\u2013720. https:\/\/doi.org\/10.1016\/j.cam.2021.113720","journal-title":"J Comput Appl Math"},{"key":"2265_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-7091-6217-0_18","volume-title":"Topics in numerical analysis","author":"N Yamashita","year":"2001","unstructured":"Yamashita N, Fukushima M (2001) On the rate of convergence of the Levenberg\u2013Marquardt method. Topics in numerical analysis. Springer, Berlin, pp 239\u2013249"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02265-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02265-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02265-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T12:35:28Z","timestamp":1680784528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02265-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,23]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2265"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02265-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,23]]},"assertion":[{"value":"26 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"126"}}