{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T10:35:21Z","timestamp":1768905321073,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T00:00:00Z","timestamp":1674345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T00:00:00Z","timestamp":1674345600000},"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":["11871453"],"award-info":[{"award-number":["11871453"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271278"],"award-info":[{"award-number":["12271278"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11731013"],"award-info":[{"award-number":["11731013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Dalian High-level Talent Innovation Projec","award":["2020RD09"],"award-info":[{"award-number":["2020RD09"]}]},{"name":"the Major Key Project of PCL","award":["PCL2022A05"],"award-info":[{"award-number":["PCL2022A05"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10915-023-02099-4","type":"journal-article","created":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T15:02:27Z","timestamp":1674399747000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stochastic Regularized Newton Methods for Nonlinear Equations"],"prefix":"10.1007","volume":"94","author":[{"given":"Jiani","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3492-9235","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,22]]},"reference":[{"key":"2099_CR1","unstructured":"Aliprantis, C.D., Border, K.C.: Infinite dimensional analysis. Springer Berlin, third ed. A hitchhiker\u2019s guide (2006)"},{"key":"2099_CR2","unstructured":"Allen-Zhu, Z., Hazan, E.: Variance reduction for faster non-convex optimization. In: ICML (2016)"},{"key":"2099_CR3","doi-asserted-by":"crossref","unstructured":"Behling, R., Iusem, A.N.: The effect of calmness on the solution set of systems of nonlinear equations. Math. Program. 137(1), 155\u2013165 (2013)","DOI":"10.1007\/s10107-011-0486-7"},{"issue":"4","key":"2099_CR4","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1137\/15M1017909","volume":"26","author":"P Bianchi","year":"2016","unstructured":"Bianchi, P.: Ergodic convergence of a stochastic proximal point algorithm. SIAM J. Optim. 26(4), 2235\u20132260 (2016)","journal-title":"SIAM J. Optim."},{"key":"2099_CR5","unstructured":"Causality workbench team (2008). A marketing dataset. http:\/\/www.causality.inf.ethz.ch\/data\/CINA.html"},{"issue":"3","key":"2099_CR6","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/j.mcm.2011.09.003","volume":"55","author":"S Chen","year":"2012","unstructured":"Chen, S., Pang, L.-P., Guo, F.-F., Xia, Z.-Q.: Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions. Math. Comput. Model. 55(3), 779\u2013784 (2012)","journal-title":"Math. Comput. Model."},{"issue":"1","key":"2099_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10957-016-0999-6","volume":"171","author":"P Dvurechensky","year":"2016","unstructured":"Dvurechensky, P., Gasnikov, A.: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle. J. Optim. Theory App. 171(1), 121\u2013145 (2016)","journal-title":"J. Optim. Theory App."},{"issue":"287","key":"2099_CR8","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1090\/S0025-5718-2013-02752-4","volume":"83","author":"J Fan","year":"2013","unstructured":"Fan, J.: Accelerating the modified Levenberg-Marquardt method for nonlinear equations. Math. Comput. 83(287), 1173\u20131187 (2013)","journal-title":"Math. Comput."},{"key":"2099_CR9","unstructured":"Guyon, I., Gunn, S., Ben-Hur, A., Dror, G.: Result analysis of the NIPS 2003 feature selection challenge. In: Advances in NIPS (pp. 545-552) (2005)"},{"issue":"2","key":"2099_CR10","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1137\/15M1031953","volume":"27","author":"AN Iusem","year":"2017","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Extragradient method with variance reduction for stochastic variational inequalities. SIAM J. Optim. 27(2), 686\u2013724 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2099_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/17M1144799","volume":"29","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Variance-based extragradient methods with line search for stochastic variational inequalities. SIAM J. Optim. 29(1), 175\u2013206 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2099_CR12","first-page":"236","volume":"44","author":"AN Iusem","year":"2018","unstructured":"Iusem, A.N., Jofr\u00e9, A., Thompson, P.: Incremental constraint projection methods for monotone stochastic variational inequalities. Math. Oper. Res. 44(1), 236\u2013263 (2018)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"2099_CR13","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/TAC.2008.925853","volume":"53","author":"H Jiang","year":"2008","unstructured":"Jiang, H., Xu, H.: Stochastic approximation approaches to the stochastic variational inequality problem. IEEE Trans. Automat. Contr. 53(6), 1462\u20131475 (2008)","journal-title":"IEEE Trans. Automat. Contr."},{"key":"2099_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12616-5","volume-title":"Numerical Solution of Stochastic Differential Equations","author":"PE Kloeden","year":"1992","unstructured":"Kloeden, P.E., Platen, E.: Numerical Solution of Stochastic Differential Equations. Springer, Berlin (1992)"},{"key":"2099_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and Stochastic Optimization Methods for Machine Learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and Stochastic Optimization Methods for Machine Learning. Springer, Berlin (2020)"},{"issue":"122","key":"2099_CR16","first-page":"1","volume":"18","author":"JD Lee","year":"2017","unstructured":"Lee, J.D., Lin, Q., Ma, T., Yang, T.: Distributed stochastic variance reduced gradient methods by sampling extra data with replacement. J. Mach. Learn. Res. 18(122), 1\u201343 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2099_CR17","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis, D.D., Yang, Y., Rose, T.G., Li, F.: RCV1: A new benchmark collection for text categorization research. J. Math. Learn. Res. 5, 361\u2013397 (2004)","journal-title":"J. Math. Learn. Res."},{"key":"2099_CR18","unstructured":"Li, X., Zhao, T., Arora, R., Liu, H., Haupt, J.: Stochastic variance reduced optimization for nonconvex sparse learning. ICML 48 (pp. 917-925) (2016)"},{"issue":"6","key":"2099_CR19","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1137\/060656486","volume":"46","author":"G Lord","year":"2008","unstructured":"Lord, G., Malham, S.J.A., Wiese, A.: Efficient strong integrators for linear stochastic systems. SIAM J. Numer. Anal. 46(6), 2892\u20132919 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"2099_CR20","doi-asserted-by":"publisher","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Comput., 4(3), https:\/\/doi.org\/10.1137\/0904038 (1983)","DOI":"10.1137\/0904038"},{"key":"2099_CR21","doi-asserted-by":"crossref","unstructured":"Mukherjee, I., Canini, K., Frongillo, R., Singer, Y.: Parallel boosting with momentum. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases (pp. 17-32). Springer, Berlin, Heidelberg (2013, September)","DOI":"10.1007\/978-3-642-40994-3_2"},{"issue":"4","key":"2099_CR22","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"2099_CR23","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1c\u0306, M.: SARAH: A novel method for machine learning problems using stochastic recursive gradient. In: ICML, 2613-2621 (2017, July)"},{"key":"2099_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wight, S.: Numerical Optimization. Springer, Berlin (2006)"},{"issue":"3","key":"2099_CR25","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1214\/15-AAP1122","volume":"26","author":"GD Nunno","year":"2016","unstructured":"Nunno, G.D., Zhang, T.: Approximations of stochastic partial differential equations. Ann. Appl. Probab. 26(3), 1443\u20131466 (2016)","journal-title":"Ann. Appl. Probab."},{"issue":"399","key":"2099_CR26","doi-asserted-by":"publisher","first-page":"948","DOI":"10.2307\/2288814","volume":"82","author":"BK \u00d8ksendal","year":"1987","unstructured":"\u00d8ksendal, B.K.: Stochastic differential equations: an introduction with applications. J. Am. Stat. Assoc. 82(399), 948 (1987)","journal-title":"J. Am. Stat. Assoc."},{"key":"2099_CR27","unstructured":"Papini, M., Binaghi, D., Canonaco, G., Pirotta, M., Restelli, M.: Stochastic variance-reduced policy gradient. In: ICML (Vol. 80, pp. 4026-4035) (2018)"},{"issue":"1","key":"2099_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/18M1216250","volume":"30","author":"C Paquette","year":"2020","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with convergence rate analysis. SIAM J. Optim. 30(1), 349\u2013376 (2020)","journal-title":"SIAM J. Optim."},{"key":"2099_CR29","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Sra, S., Poczos, B., Smola, A.J.: Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization. In: NeurIPS (pp. 1145-1153) (2016)","DOI":"10.1109\/CDC.2016.7798553"},{"key":"2099_CR30","volume-title":"Introduction to Stochastic Dynamic Progrmaming","author":"SM Ross","year":"1983","unstructured":"Ross, S.M.: Introduction to Stochastic Dynamic Progrmaming. Academic Press (1983)"},{"key":"2099_CR31","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on stochastic programming: modeling and theory. MOS-SIAM Series on Optimization (2009)","DOI":"10.1137\/1.9780898718751"},{"issue":"6","key":"2099_CR32","doi-asserted-by":"publisher","first-page":"3585","DOI":"10.1016\/j.nonrwa.2011.06.017","volume":"12","author":"J Tang","year":"2011","unstructured":"Tang, J., Ma, C.: A smoothing Newton method for solving a class of stochastic linear complementarity problems. Nonlinear Anal-Real World Appl 12(6), 3585\u20133601 (2011)","journal-title":"Nonlinear Anal-Real World Appl"},{"key":"2099_CR33","unstructured":"Tran-Dinh, Q., Pham N.H., Nguyen, L.: Stochastic Gauss-Newton Algorithms for Nonconvex Compositional Optimization. In: ICML (2020)"},{"issue":"4","key":"2099_CR34","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389\u2013434 (2012)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"2099_CR35","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10957-010-9731-0","volume":"147","author":"K Ueda","year":"2010","unstructured":"Ueda, K., Yamashita, N.: On a global complexity bound of the levenberg-marquardt method. J. Optim. Theory Appl. 147(3), 443\u2013453 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"2099_CR36","unstructured":"Vaswani, S., Mishkin, A., Laradji, I., Schmidt, M., Gidel, G., Lacoste-Julien, S.: Painless stochastic gradient: interpolation, line search, and convergence rates. arXiv preprint arXiv:1905.09997 (2019)"},{"key":"2099_CR37","unstructured":"Wang, Z., Zhou, Y., Liang, Y., Lan, G.: Stochastic variance-reduced cubic regularization for nonconvex optimization. nt. Conf. Artif. Intell. Stat., 2731-2740 (2019)"},{"issue":"4","key":"2099_CR38","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/1037125","volume":"37","author":"TJ Ypma","year":"1995","unstructured":"Ypma, T.J.: Historical development of the Newton-Raphson method. SIAM Rev. 37(4), 531\u2013551 (1995)","journal-title":"SIAM Rev."},{"key":"2099_CR39","unstructured":"Zhang, J., Xiao, L., Zhang, S.: Adaptive stochastic variance reduction for subsampled newton method with cubic regularization. Optimization and Control, ArXiv (2018)"},{"key":"2099_CR40","first-page":"9078","volume":"32","author":"J Zhang","year":"2019","unstructured":"Zhang, J., Xiao, L.: A stochastic composite gradient method with incremental variance reduction. Adv. NeurIPS 32, 9078\u20139088 (2019)","journal-title":"Adv. NeurIPS"},{"key":"2099_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xiao, L.: Stochastic Variance-reduced Prox-linear Algorithms for Nonconvex Composite Optimization. Math. Program., 1-43 (2021)","DOI":"10.1007\/s10107-021-01709-z"},{"issue":"4","key":"2099_CR42","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/10556788.2016.1179737","volume":"31","author":"R Zhao","year":"2016","unstructured":"Zhao, R., Fan, J.: Global complexity bound of the Levenberg-Marquardt method. Optim. Methods Softw. 31(4), 805\u2013814 (2016)","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02099-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02099-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02099-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T21:10:41Z","timestamp":1677100241000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02099-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,22]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2099"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02099-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,22]]},"assertion":[{"value":"22 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2023","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 have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"51"}}