{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:01:14Z","timestamp":1768280474307,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:00:00Z","timestamp":1665446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:00:00Z","timestamp":1665446400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Special Funds for Local Science and Technology Development Guided by the Central Government","award":["ZY20198003"],"award-info":[{"award-number":["ZY20198003"]}]},{"name":"High Level Innovation Teams and Excellent Scholars Program in Guangxi institutions of higher education","award":["[2019]52"],"award-info":[{"award-number":["[2019]52"]}]},{"name":"Guangxi Natural Science Key Fund","award":["2017GXNSFDA198046"],"award-info":[{"award-number":["2017GXNSFDA198046"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11661009"],"award-info":[{"award-number":["11661009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s12190-022-01800-4","type":"journal-article","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T11:03:38Z","timestamp":1665486218000},"page":"1491-1506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A modified stochastic quasi-Newton algorithm for summing functions problem in machine learning"],"prefix":"10.1007","volume":"69","author":[{"given":"Xiaoxuan","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9036-9340","authenticated-orcid":false,"given":"Haishan","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"1800_CR1","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u2019, pp. 177\u2013186 (2010)","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"1800_CR2","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., et al.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Optim. 26, 1008\u20131031 (2012)","journal-title":"SIAM J. Optim."},{"key":"1800_CR3","unstructured":"Cotter, A., Shamir, O., Srebro, N., Sridharan, K.: Better mini-batch algorithms via accelerated gradient methods. In: Proceedings of the Advances in Neural Information Processing Systems, pp. 1647\u20131655 (2011)"},{"key":"1800_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge University Press, London (2010)"},{"key":"1800_CR5","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., RichtSrik, P.: Accelerated, parallel, and proximal coordinate descent. SIAM J. Optim. 25, 1997\u20132023 (2015)","journal-title":"SIAM J. Optim."},{"key":"1800_CR6","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, 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"1800_CR7","first-page":"701","volume":"2","author":"B Hassan","year":"2020","unstructured":"Hassan, B., Mohammed, T.: A new variants of quasi-newton equation based on the quadratic function for unconstrained optimization. Indones. J. Electr. Eng. Comput. Sci. 2, 701\u2013708 (2020)","journal-title":"Indones. J. Electr. Eng. Comput. Sci."},{"key":"1800_CR8","unstructured":"Lan, G.: An optimal method for stochastic convex optimization. Technical report, Georgia Institute of Technology (2009)"},{"key":"1800_CR9","doi-asserted-by":"crossref","unstructured":"Li, M., Zhang, T., Chen, Y., et al.: Efficient mini-batch training for stochastic optimization. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 661\u2013670 (2014)","DOI":"10.1145\/2623330.2623612"},{"key":"1800_CR10","first-page":"512","volume":"12","author":"L Mason","year":"1999","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent in function space. Adv. Neural Inf. Process. Syst. 12, 512\u2013518 (1999)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1800_CR11","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1137\/17M1122943","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Eisen, M., Ribeiro, A.: IQN: An incremental quasi-Newton method with local superlinear convergence rate. SIAM J. Optim. 28, 1670\u20131698 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1800_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)","journal-title":"SIAM J. Optim."},{"key":"1800_CR13","unstructured":"Powell, M.J.D.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Cottle, R.W., Lemke, C.E. (eds.) Nonlinear Programming, Philadelphia (1976)"},{"key":"1800_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"1800_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gr1adient. Math. Program. 162, 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"1800_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TKDE.2018.2878765","volume":"32","author":"F Shang","year":"2018","unstructured":"Shang, F., Zhou, K., Liu, H., et al.: VR-SGD: a simple stochastic variance reduction method for machine learning. IEEE Trans. Knowl. Data Eng. 32, 188\u2013202 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1800_CR17","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, 927\u2013956 (2017)","journal-title":"SIAM J. Optim."},{"key":"1800_CR18","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., et al.: The superlinear convergence of a modified BFGS-type method for unconstrained optimization. Comput. Optim. Appl. 29, 315\u2013332 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"1800_CR19","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, 315\u2013332 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"1800_CR20","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., et al.: Mini-batch algorithms with Barzilai\u2013Borwein update step. Neurocomputing 314, 177\u2013185 (2018)","journal-title":"Neurocomputing"},{"key":"1800_CR21","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, 237\u2013255 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"1800_CR22","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., et al.: Stochastic bigger subspace algorithms for nonconvex stochastic optimization. IEEE Access 9, 119818\u2013119829 (2021)","journal-title":"IEEE Access"},{"key":"1800_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"JZ Zhang","year":"1999","unstructured":"Zhang, J.Z., Deng, N.Y., Chen, L.H.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102, 147\u2013167 (1999)","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-022-01800-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01800-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01800-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T13:22:40Z","timestamp":1679318560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01800-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,11]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1800"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01800-4","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,11]]},"assertion":[{"value":"9 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2022","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 declare to have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}