{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T14:31:26Z","timestamp":1787668286198,"version":"build-2736575974"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s12190-026-02871-3","type":"journal-article","created":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T10:06:00Z","timestamp":1786529160000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A stochastic machine learning algorithm based on a cautious BFGS update formula"],"prefix":"10.1007","volume":"72","author":[{"given":"Xiaoxuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maoyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junyu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"issue":"2","key":"2871_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s11075-017-0321-1","volume":"77","author":"N. Andrei","year":"2018","unstructured":"Andrei, N.: An adaptive scaled BFGS method for unconstrained optimization. Numer. Algor. 77(2), 413\u2013432 (2018). https:\/\/doi.org\/10.1007\/s11075-017-0321-1","journal-title":"Numer Algor"},{"key":"2871_CR2","first-page":"177","volume-title":"Large-Scale Machine Learning with Stochastic Gradient descent[C]\/\/Proceedings of Compstat\u20192010.","author":"L. Bottou","year":"2010","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent[C]\/\/proceedings of compstat\u20192010. pp. 177\u2013186. Physica-Verlag HD, Heidelberg (2010)"},{"issue":"2","key":"2871_CR3","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"R.H. Byrd","year":"2016","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-newton method for large-scale optimization. SIAM J. Optim. 26(2), 1008\u20131031 (2016). https:\/\/doi.org\/10.1137\/140954362","journal-title":"SIAM J Optim."},{"key":"2871_CR4","unstructured":"Cotter, A., Shamir, O., Srebro, N., et al.: Better mini-batch algorithms via accelerated gradient methods[C]\/\/Advances in neural information processing systems. 1647\u20131655 (2011)"},{"key":"2871_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Feng, H.: A modified stochastic quasi-newton algorithm for summing functions problem in machine learning. J. Appl. Math. Comput. 69(2), 1491\u20131506 (2023)","DOI":"10.1007\/s12190-022-01800-4"},{"key":"2871_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: theory and Examples[M]","author":"R. Durrett","year":"2010","unstructured":"Durrett, R.: Probability: theory and examples[M]. Cambridge University Press, London (2010)"},{"issue":"4","key":"2871_CR7","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S. Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013). https:\/\/doi.org\/10.1137\/120880811","journal-title":"SIAM J Optim."},{"issue":"2","key":"2871_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.11591\/ijeecs.v19.i2.pp701-708","volume":"19","author":"B.A. Hassan","year":"2020","unstructured":"Hassan, B.A., Taha, M.W.: A new variants of quasi-Newton equation based on the quadratic function for unconstrained optimization. IJEECS 19(2), 701\u2013708 (2020). https:\/\/doi.org\/10.11591\/ijeecs.v19.i2.pp701-708","journal-title":"IJEECS"},{"issue":"1\u20132","key":"2871_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G. Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1\u20132), 365\u2013397 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0434-y","journal-title":"Math. Program."},{"key":"2871_CR10","doi-asserted-by":"crossref","unstructured":"Li, M., Zhang, T., Chen, Y., et al.: Efficient mini-batch training for stochastic. In: Optimization[C]\/\/Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 661\u2013670. (2014)","DOI":"10.1145\/2623330.2623612"},{"key":"2871_CR11","unstructured":"Mason, L., Baxter, J., Bartlett, P., et al.: Boosting algorithms as gradient descent[C]\/\/Advances in neural information processing systems. 12, (1999)"},{"issue":"4","key":"2871_CR12","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). https:\/\/doi.org\/10.1137\/070704277","journal-title":"SIAM J Optim."},{"key":"2871_CR13","unstructured":"Powell, M.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches[C]\/\/SIAM-AMS proceedings. (1975)"},{"issue":"1\u20132","key":"2871_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M. Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1030-6","journal-title":"Math. Program."},{"issue":"1","key":"2871_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TKDE.2018.2878765","volume":"32","author":"F. Shang","year":"2020","unstructured":"Shang, F., Zhou, K., Liu, H., Cheng, J., Tsang, I.W., Zhang, L., Tao, D., Jiao, L.: VR-SGD: a simple stochastic variance reduction method for machine learning. IEEE Trans. Knowl. Data Eng. 32(1), 188\u2013202 (2020). https:\/\/doi.org\/10.1109\/TKDE.2018.2878765","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"2871_CR16","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/15M1053141","volume":"27","author":"X. Wang","year":"2017","unstructured":"Wang, X., Ma, S., Goldfarb, D., Liu, W.: Stochastic quasi-newton methods for nonconvex stochastic optimization. SIAM J. Optim. 27(2), 927\u2013956 (2017). https:\/\/doi.org\/10.1137\/15M1053141","journal-title":"SIAM J Optim."},{"issue":"3","key":"2871_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/B:COAP.0000044184.25410.39","volume":"29","author":"Z. Wei","year":"2004","unstructured":"Wei, Z., Yu, G., Yuan, G., Lian, Z.: The superlinear convergence of a modified BFGS-type method for unconstrained optimization. Comput. Optim. Appl. 29(3), 315\u2013332 (2004). https:\/\/doi.org\/10.1023\/B:COAP.0000044184.25410.39","journal-title":"Comput. Optim. Appl."},{"key":"2871_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.neucom.2018.06.002","volume":"314","author":"Z. Yang","year":"2018","unstructured":"Yang, Z., Wang, C., Zang, Y., Li, J.: Mini-batch algorithms with Barzilai\u2013borwein update step. Neurocomputing. 314, 177\u2013185 (2018). https:\/\/doi.org\/10.1016\/j.neucom.2018.06.002","journal-title":"Neurocomputing"},{"key":"2871_CR19","doi-asserted-by":"publisher","first-page":"119818","DOI":"10.1109\/ACCESS.2021.3108418","volume":"9","author":"G. Yuan","year":"2021","unstructured":"Yuan, G., Zhou, Y., Wang, L., Yang, Q.: Stochastic bigger subspace algorithms for Nonconvex stochastic Optimization. IEEE. Access 9, 119818\u2013119829 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3108418","journal-title":"IEEE. Access"},{"issue":"2","key":"2871_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10589-008-9219-0","volume":"47","author":"G. Yuan","year":"2010","unstructured":"Yuan, G., Wei, Z.: Convergence analysis of a modified BFGS method on convex minimizations. Comput. Optim. Appl. 47(2), 237\u2013255 (2010). https:\/\/doi.org\/10.1007\/s10589-008-9219-0","journal-title":"Comput. Optim. Appl."},{"key":"2871_CR21","doi-asserted-by":"publisher","first-page":"107634","DOI":"10.1016\/j.aml.2021.107634","volume":"124","author":"G. Yuan","year":"2022","unstructured":"Yuan, G., Zhang, M., Zhou, Y.: Adaptive scaling damped BFGS method without gradient Lipschitz continuity. Appl. Math. Lett. 124, 107634 (2022). https:\/\/doi.org\/10.1016\/j.aml.2021.107634","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"2871_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"J. Zhang","year":"1999","unstructured":"Zhang, J., Deng, N., Chen, L.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102(1), 147\u2013167 (1999). https:\/\/doi.org\/10.1023\/A:1021898630001","journal-title":"J Optim Theory Appl."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02871-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02871-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02871-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T13:57:28Z","timestamp":1787666248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02871-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["2871"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02871-3","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"11 June 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare to have no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"218"}}