{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:58:39Z","timestamp":1755694719661,"version":"3.38.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"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":["12371307"],"award-info":[{"award-number":["12371307"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Municipal Science and Technology Key Project","award":["22JC1401500"],"award-info":[{"award-number":["22JC1401500"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10589-024-00639-8","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T06:36:27Z","timestamp":1735886187000},"page":"417-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence of a stochastic variance reduced Levenberg\u2013Marquardt method"],"prefix":"10.1007","volume":"90","author":[{"given":"Weiyi","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"issue":"2","key":"639_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"639_CR2","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1-27:27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"639_CR3","doi-asserted-by":"crossref","unstructured":"\u00c7inlar, E., \u00f0C\u0131nlar, E.: Probability and Stochastics. Springer, vol. 261 (2011)","DOI":"10.1007\/978-0-387-87859-1"},{"key":"639_CR4","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"639_CR5","unstructured":"Derezinski, M.: Stochastic variance-reduced Newton: accelerating finite-sum minimization with large batches (2022). arXiv:2206.02702"},{"key":"639_CR6","doi-asserted-by":"crossref","unstructured":"Durrett, R.: Probability: Theory and Examples. vol. 49, Cambridge University Press (2019)","DOI":"10.1017\/9781108591034"},{"key":"639_CR7","doi-asserted-by":"publisher","first-page":"112211","DOI":"10.1016\/j.jcp.2023.112211","volume":"488","author":"F Heldmann","year":"2023","unstructured":"Heldmann, F., Treibert, S., Ehrhardt, M., Klamroth, K.: Pinn training using biobjective optimization: the trade-off between data loss and residual loss. J. Comput. Phys. 488, 112211 (2023)","journal-title":"J. Comput. Phys."},{"key":"639_CR8","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. Neural Inf. Process. Syst. 26 (2013)"},{"key":"639_CR9","unstructured":"Laha, R.G., Rohatgi, V.K.: Probability Theory, Courier Dover Publications (2020)"},{"key":"639_CR10","unstructured":"Liu, H., Hu, J., Li, Y., Wen, Z.: Optimization: Modeling, Algorithm and Theory (in Chinese)"},{"key":"639_CR11","first-page":"1","volume-title":"Nonlinear Programming 2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 2, pp. 1\u201327. Academic Press, New York (1975)"},{"key":"639_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-023-00529-6","author":"W Shao","year":"2024","unstructured":"Shao, W., Fan, J.: Global convergence of a stochastic Levenberg\u2013Marquardt algorithm based on trust region. J. Operat. Rese. Soc. China (2024). https:\/\/doi.org\/10.1007\/s40305-023-00529-6","journal-title":"J. Operat. Rese. Soc. China"},{"key":"639_CR13","unstructured":"Song, P.X.-K., Li, Mingyao, Zhang, Peng: Chapter 12\u2013Vector Generalized Linear Models: A Gaussian Copula Approach"},{"key":"639_CR14","doi-asserted-by":"crossref","unstructured":"Song, P.X., Li, M., Zhang, P.: Vector generalized linear models: A gaussian copula approach (2013)","DOI":"10.1007\/978-3-642-35407-6_12"},{"key":"639_CR15","unstructured":"Tran-Dinh, Q., Pham, N., Nguyen, L.: Stochastic gauss-Newton algorithms for nonconvex compositional optimization. In: International Conference on Machine Learning. PMLR, pp. 9572\u20139582 (2020)"},{"issue":"3","key":"639_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10915-023-02099-4","volume":"94","author":"J Wang","year":"2023","unstructured":"Wang, J., Wang, X., Zhang, L.: Stochastic regularized Newton methods for nonlinear equations. J. Sci. Comput. 94(3), 51 (2023)","journal-title":"J. Sci. Comput."},{"issue":"6","key":"639_CR17","doi-asserted-by":"publisher","first-page":"4621","DOI":"10.1007\/s12190-022-01722-1","volume":"68","author":"Z Wang","year":"2022","unstructured":"Wang, Z., Wen, B.: Stochastic Gauss-Newton algorithm with STORM estimators for nonconvex composite optimization. J. Appl. Math. Comput. 68(6), 4621\u20134643 (2022)","journal-title":"J. Appl. Math. Comput."},{"key":"639_CR18","doi-asserted-by":"crossref","unstructured":"Yasuda, S., Mahboubi, S., Indrapriyadarsini, S., Ninomiya, H., Asai, H.: A stochastic variance reduced nesterov\u2019s accelerated quasi-newton method. In: 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA), 2019 2019, Conference Paper, pp. 1874\u20139, 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA), pp. 16\u201319: Boca Raton. FL, USA (2019)","DOI":"10.1109\/ICMLA.2019.00301"},{"key":"639_CR19","unstructured":"Zhang, J., Xiao, L.: Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (2020). arXiv:2004.04357"},{"key":"639_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, L., Mammadov, M.A., Yearwood, J.: From convex to nonconvex: A loss function analysis for binary classification. In: IEEE International Conference on Data Mining Workshops, pp. 1281\u20131288 (2010)","DOI":"10.1109\/ICDMW.2010.57"},{"key":"639_CR21","first-page":"134","volume":"20","author":"D Zhou","year":"2019","unstructured":"Zhou, D., Xu, P.: Gu, Q: Stochastic variance-reduced cubic regularization methods. J. Mach. Learn. Res. 20, 134 (2019)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00639-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00639-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00639-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T11:37:16Z","timestamp":1740742636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00639-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["639"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00639-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,1,3]]},"assertion":[{"value":"25 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 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 declared that they have no Conflict of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}