{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:09:01Z","timestamp":1774624141690,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"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,3]]},"DOI":"10.1007\/s12190-026-02767-2","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T14:21:53Z","timestamp":1770128513000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic conjugate gradient algorithm with an inertial extrapolation step for nonconvex optimization in machine learning"],"prefix":"10.1007","volume":"72","author":[{"given":"Yijia","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beisai","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2667-5834","authenticated-orcid":false,"given":"Gonglin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"2767_CR1","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H. Robbins","year":"1951","unstructured":"Robbins, H.: A stochastic approximation method. Ann. Math. Statist. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Statist."},{"key":"2767_CR2","unstructured":"Roux, N.L., Schmidt, M.W., Bach, F.: Astochastic gradient method with an exponential convergence rate for finite training sets. Neural Inf. Process. Syst. 2663\u20132671 (2012)"},{"key":"2767_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"S. Mark","year":"2017","unstructured":"Mark, S., Le, R.N., Francis, B.: Minimizing finite sums with the stochastic average gradient. Math Program 162, 83\u2013112 (2017)","journal-title":"Math Program"},{"key":"2767_CR4","first-page":"567","volume":"14","author":"S.S. Shwartz","year":"2013","unstructured":"Shwartz, S.S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"2767_CR5","first-page":"1","volume":"144","author":"R. Peter","year":"2014","unstructured":"Peter, R., Martin, T.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math Program 144, 1\u201338 (2014)","journal-title":"Math Program"},{"key":"2767_CR6","first-page":"315","volume":"1","author":"R. Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Neural Inf. Process. Syst. 1, 315\u2013323 (2013)","journal-title":"Neural Inf. Process. Syst."},{"key":"2767_CR7","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: Stochastic recursive gradient algorithm for nonconvex optimization. (2017), arXiv preprint arXiv:1705.07261"},{"key":"2767_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2022.117719","volume":"206","author":"Z. Yang","year":"2022","unstructured":"Yang, Z.: Adaptive stochastic conjugate gradient for machine learning. Expert. Syst. Appl. 206, 1\u201314 (2022)","journal-title":"Expert. Syst. Appl."},{"key":"2767_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2023.121556","volume":"238","author":"R.P. Huang","year":"2024","unstructured":"Huang, R.P., Qin, Y., Liu, K.J., Yuan, G.L.: Biased stochastic conjugate gradient algorithm with adaptive step size for nonconvex problems. Expert. Syst. Appl. 238, 1\u201314 (2024)","journal-title":"Expert. Syst. Appl."},{"key":"2767_CR10","doi-asserted-by":"crossref","unstructured":"Mo, Z.Y., Ouyang, C., Pham, H., Yuan, G.L.: A stochastic recursive gradient algorithm with inertial extrapolation for non-convex problems and machine learning. Int. J. Mach. Learn. Cyber. 1\u201315 (2025)","DOI":"10.21203\/rs.3.rs-4179579\/v1"},{"key":"2767_CR11","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization\u201d, arXiv preprint arXiv:1412.6980, (2014)"},{"key":"2767_CR12","unstructured":"Tieleman, T., Hinton, G.: Divide the gradient by a running average of its recent magnitude\u201d, coursera: Neural networks for machine learning: Technical report, (2012)"},{"issue":"7","key":"2767_CR13","first-page":"2121","volume":"12","author":"J. Duchi","year":"2011","unstructured":"Duchi, J., E, E.H., Singer, Y.: Adaptive subgradient methods for nonline learning and stochastic optimization. J. Mach. Learn. Res. 12(7), 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2767_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J. Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"2767_CR15","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ins.2015.03.073","volume":"316","author":"K. Sopyla","year":"2015","unstructured":"Sopyla, K., Drozda, P.: Stochastic gradient descent with Barzilai-Borwein update step for SVM. Inf. Sci. 316, 218\u2013233 (2015)","journal-title":"Inf. Sci."},{"key":"2767_CR16","first-page":"1","volume":"29","author":"C.H. Tan","year":"2016","unstructured":"Tan, C.H., Ma, S.Q., Dai, Y.H., Qian, Y.Q.: Barzilai-borwein step size for stochastic gradient descent. Neural Inf. Process. Syst. 29, 1\u201317 (2016)","journal-title":"Neural Inf. Process. Syst."},{"key":"2767_CR17","unstructured":"Schraudolph, N., Graepel, T.: Combining conjugate direction methods with stochastic approximation of gradients. In: In International workshop on artificial intelligence and statistics, pp. 248\u2013253. (2003)"},{"key":"2767_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"134","author":"R.H. Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.C.: Sample size selection in optimization methods for machine learning. Math. Program 134, 127\u2013157 (2012)","journal-title":"Math. Program"},{"key":"2767_CR19","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1109\/TNNLS.2018.2868835","volume":"30","author":"X.B. Jin","year":"2019","unstructured":"Jin, X.B., Zhang, X.Y., Huang, K.Z., Geng, G.G.: Stochastic conjugate gradient algorithm with variance reduction. IEEE Trans. Neural Networks Learn. Syst. 30, 1360\u20131369 (2019)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"2767_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math10193595","volume":"10","author":"K.A. Alnowibet","year":"2022","unstructured":"Alnowibet, K.A., Mahdi, S., Alshamrani, A.M., Sallam, K.M., Mohamed, A.W.: A family of hybrid stochastic conjugate gradient algorithms for local and global minimization problems. Mathematics 10, 1\u201337 (2022)","journal-title":"Mathematics"},{"key":"2767_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11222-024-10409-5","volume":"34","author":"C. OuYang","year":"2024","unstructured":"OuYang, C., Lu, C.K.X., Zhao, X., Huang, R.P., Yuan, G.L., Jiang, Y.Y.: Stochastic three-term conjugate gradient method with variance technique for non-convex learning. Stat. Comput. 34, 1\u201313 (2024)","journal-title":"Stat. Comput."},{"issue":"2","key":"2767_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/0266-5611\/29\/2\/025011","volume":"29","author":"P.J. Chen","year":"2013","unstructured":"Chen, P.J., Huang, J.G., Zhang X., X.Q.: A primal\u2013dual fixed point algorithm for convex separable minimization with applications to image restoration. Inverse Probl. 29(2), 1\u201333 (2013)","journal-title":"Inverse Probl."},{"issue":"5","key":"2767_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B.T. Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201311 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"2767_CR24","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10898-020-00943-7","volume":"79","author":"Z.M. Wu","year":"2021","unstructured":"Wu, Z.M., Li, C.S., Li, M., Lim., A.: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J. Glob. Optim. 79(3), 617\u2013644 (2021)","journal-title":"J. Glob. Optim."},{"key":"2767_CR25","first-page":"1","volume":"26","author":"S.Y. Sun","year":"2023","unstructured":"Sun, S.Y., He, L.L.: General inertial proximal stochastic variance reduction gradient for nonconvex nonsmooth optimization. j.Inequal. Appl. 26, 1\u201322 (2023)","journal-title":"j.Inequal. Appl."},{"key":"2767_CR26","doi-asserted-by":"crossref","unstructured":"Hertrich, J., Steidl, G.: Inertial stochastic PALM (iSPALM) and applications in machine learning. Sampl. Theory. Signal Process Data Anal. 20 (2022)","DOI":"10.1007\/s43670-022-00021-x"},{"key":"2767_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2023.119546","volume":"648","author":"L.L. He","year":"2023","unstructured":"He, L.L., Ye, J.M., E, J.W.: Nonconvex optimization with inertial proximal stochastic variance reduction gradient. Inf. Sci. 648, 1\u201321 (2023)","journal-title":"Inf. Sci."},{"key":"2767_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11075-018-0603-2","volume":"82","author":"J.K. Liu","year":"2019","unstructured":"Liu, J.K., Feng, Y.M.: A derivative-free iterative method for nonlinear monotone equations with convex constraints. Numer. Algor. 82, 245\u2013262 (2019)","journal-title":"Numer. Algor."},{"key":"2767_CR29","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1007\/s11075-022-01356-1","volume":"92","author":"G.D. Ma","year":"2022","unstructured":"Ma, G.D., Jin, J.C., Jian, H.Y., Han, D.L.: A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing. Numer. Algor. 92, 1621\u20131653 (2022)","journal-title":"Numer. Algor."},{"key":"2767_CR30","doi-asserted-by":"publisher","first-page":"2287","DOI":"10.1137\/23M1599045","volume":"34","author":"W.P. Yan","year":"2024","unstructured":"Yan, W.P., Tang, Y., Yuan, G.L.: Fast optimization of charged particle dynamics with damping. SIAM J. Optim. 34, 2287\u20132313 (2024)","journal-title":"SIAM J. Optim."},{"key":"2767_CR31","doi-asserted-by":"crossref","unstructured":"Yan, W.P., Cao, H.P., Wu, D.X., Yuan, G.L.: Fast optimization and algorithms for the charged particle dynamics with variable density. Bull. Math. Sci. 1\u201340 (2025)","DOI":"10.1142\/S1664360725500250"},{"key":"2767_CR32","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"M.J.D. Powell","year":"1986","unstructured":"Powell, M.J.D.: Convergence properties of algorithms for nonlinear optimization. SIAM Rev. 28, 487\u2013500 (1986)","journal-title":"SIAM Rev."},{"issue":"2","key":"2767_CR33","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R. Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"2767_CR34","unstructured":"Zhou, X.Y.: On the fenchel duality between Strong convexity and Lipschitz continuous gradient\u201d, arXiv preprint arXiv:1803.06573, (2018)"},{"key":"2767_CR35","doi-asserted-by":"publisher","first-page":"119818","DOI":"10.1109\/ACCESS.2021.3108418","volume":"9","author":"G.L. Yuan","year":"2021","unstructured":"Yuan, G.L., Zhou, Y.J., Wang, L.P., Yang, Q.Y.: Stochastic bigger subspace algorithms for nonconvex stochastic optimization. IEEE Access 9, 119818\u2013119829 (2021)","journal-title":"IEEE Access"},{"key":"2767_CR36","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.apnum.2024.12.015","volume":"210","author":"Y.J. Wang","year":"2025","unstructured":"Wang, Y.J., Ouyang, C., Lv, L.F., Yuan, G.L.: Analysis of a new BFGS algorithm and conjugate gradient algorithms and their applications in image restoration and machine learning. Appl. Numer. Math. 210, 199\u2013221 (2025)","journal-title":"Appl. Numer. Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02767-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02767-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02767-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:07:00Z","timestamp":1774620420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02767-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,3]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2767"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02767-2","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,3]]},"assertion":[{"value":"24 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2026","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 stated that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"115"}}