{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:21:09Z","timestamp":1783038069767,"version":"3.54.6"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100017691","name":"Guangxi Key Research and Development Program","doi-asserted-by":"publisher","award":["AB25069188"],"award-info":[{"award-number":["AB25069188"]}],"id":[{"id":"10.13039\/501100017691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017691","name":"Guangxi Key Research and Development Program","doi-asserted-by":"publisher","award":["FN2504240016"],"award-info":[{"award-number":["FN2504240016"]}],"id":[{"id":"10.13039\/501100017691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017691","name":"Guangxi Key Research and Development Program","doi-asserted-by":"publisher","award":["FN2504240023"],"award-info":[{"award-number":["FN2504240023"]}],"id":[{"id":"10.13039\/501100017691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018571","name":"Specific Research Project of Guangxi for Research Bases and Talents","doi-asserted-by":"publisher","award":["AD22080047"],"award-info":[{"award-number":["AD22080047"]}],"id":[{"id":"10.13039\/501100018571","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117848","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T06:32:05Z","timestamp":1780122725000},"page":"117848","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Modified stochastic conjugate gradient algorithm in machine learning"],"prefix":"10.1016","volume":"488","author":[{"given":"Ruibin","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongyu","family":"Mo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2667-5834","authenticated-orcid":false,"given":"Gonglin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117848_bib0001","series-title":"Proc. 26th Annu. Int. Conf. Mach. Learn. (ICML)","first-page":"689","article-title":"Online dictionary learning for sparse coding","author":"Mairal","year":"2009"},{"key":"10.1016\/j.cam.2026.117848_bib0002","series-title":"Understanding Machine Learning: From Theory to Algorithms","author":"Shalev-Shwartz","year":"2014"},{"key":"10.1016\/j.cam.2026.117848_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.najef.2021.101510","article-title":"Forecasting stock market volatility: can the risk aversion measure exert an important role?","volume":"58","author":"Dai","year":"2021","journal-title":"North Amer. J. Econ. Finance"},{"key":"10.1016\/j.cam.2026.117848_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.irfa.2021.101676","article-title":"Predicting stock returns: a risk measurement perspective","volume":"74","author":"Dai","year":"2021","journal-title":"Int. Rev. Financial Anal."},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0005","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1022558715350","article-title":"The mixed logit model: the state of practice","volume":"30","author":"Hensher","year":"2003","journal-title":"Transportation"},{"key":"10.1016\/j.cam.2026.117848_bib0006","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1016\/j.neucom.2014.08.067","article-title":"Combination of multiple bipartite ranking for multipartite web content quality evaluation","volume":"149","author":"Jin","year":"2015","journal-title":"Neurocomputing"},{"key":"10.1016\/j.cam.2026.117848_bib0007","series-title":"Advances in Neural Information Processing Systems","article-title":"MCRank: learning to rank using multiple classification and gradient boosting","volume":"20","author":"Li","year":"2007"},{"key":"10.1016\/j.cam.2026.117848_bib0008","series-title":"Advances in Neural Information Processing Systems 14","first-page":"641","article-title":"Pranking with ranking","author":"Crammer","year":"2001"},{"key":"10.1016\/j.cam.2026.117848_bib0009","series-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"133","article-title":"Optimizing search engines using clickthrough data","author":"Joachims","year":"2002"},{"key":"10.1016\/j.cam.2026.117848_bib0010","series-title":"Proceedings of the 22nd International Conference on Machine Learning","first-page":"89","article-title":"Learning to rank using gradient descent","author":"Burges","year":"2005"},{"key":"10.1016\/j.cam.2026.117848_bib0011","series-title":"Advances in Neural Information Processing Systems 22","first-page":"1883","article-title":"Learning to rank by optimizing NDCG measure","author":"Valizadegan","year":"2009"},{"key":"10.1016\/j.cam.2026.117848_bib0012","series-title":"Proceedings of the 24th International Conference on Machine Learning","first-page":"129","article-title":"Learning to rank: from pairwise approach to listwise approach","author":"Cao","year":"2007"},{"key":"10.1016\/j.cam.2026.117848_bib0013","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1016\/j.patcog.2010.01.013","article-title":"Regularized margin-based conditional log-likelihood loss for prototype learning","volume":"43","author":"Jin","year":"2010","journal-title":"Pattern Recognit."},{"issue":"9","key":"10.1016\/j.cam.2026.117848_bib0014","doi-asserted-by":"crossref","first-page":"2206","DOI":"10.1109\/TNNLS.2014.2371492","article-title":"Retargeted least squares regression algorithm","volume":"26","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"6","key":"10.1016\/j.cam.2026.117848_bib0015","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1007\/s12559-018-9583-8","article-title":"Accelerating infinite ensemble of clustering by pivot features","volume":"10","author":"Jin","year":"2018","journal-title":"Cognit. Comput."},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0016","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0804017","article-title":"Convergence theory of nonlinear Newton\u2013Krylov algorithms","volume":"4","author":"Brown","year":"1994","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0017","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1016\/j.amc.2005.08.027","article-title":"New quasi-Newton methods for unconstrained optimization problems","volume":"175","author":"Wei","year":"2006","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.cam.2026.117848_bib0018","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","article-title":"A stochastic approximation method","volume":"22","author":"Robbins","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.cam.2026.117848_bib0019","series-title":"Proc. Adv. Neural Inf. Process. Syst.","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"Johnson","year":"2013"},{"key":"10.1016\/j.cam.2026.117848_bib0020","series-title":"International Conference on Machine Learning","article-title":"SARAH: a novel method for machine learning problems using stochastic recursive gradient","author":"Nguyen","year":"2017"},{"key":"10.1016\/j.cam.2026.117848_bib0021","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.amc.2015.08.014","article-title":"A modified Perry\u2019s conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations","volume":"270","author":"Dai","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117848_bib0022","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Method of conjugate gradient for solving linear equations","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"1","key":"10.1016\/j.cam.2026.117848_bib0023","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00940464","article-title":"Effcient generalized conjugate gradient algorithms Part 1 theory","volume":"69","author":"Liu","year":"1991","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0024","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.amc.2005.11.150","article-title":"New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems","volume":"179","author":"Wei","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117848_bib0025","first-page":"35","article-title":"Note sur la convergence de directions conjugees","volume":"3","author":"Polak","year":"1969","journal-title":"ESAIM Math. Model. Numer. Anal. Mod\u00e9l. Math. Anal. Num."},{"key":"10.1016\/j.cam.2026.117848_bib0026","series-title":"Practical Methods of Optimization","author":"Fletcher","year":"2000"},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0027","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"issue":"1","key":"10.1016\/j.cam.2026.117848_bib0028","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","article-title":"A nonlinear conjugate gradient method with a strong global convergence property","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117848_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117719","article-title":"Adaptive stochastic conjugate gradient for machine learning","volume":"206","author":"Yang","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117848_bib0030","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","article-title":"Two-point step size gradient methods","volume":"8","author":"Barzilai","year":"1988","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/j.cam.2026.117848_bib0031","article-title":"Biased stochastic conjugate gradient algorithm with adaptive step size for nonconvex problems","author":"Huang","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cam.2026.117848_bib0032","doi-asserted-by":"crossref","first-page":"119818","DOI":"10.1109\/ACCESS.2021.3108418","article-title":"Stochastic bigger subspace algorithms for nonconvex stochastic optimization","volume":"9","author":"Yuan","year":"2021","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.cam.2026.117848_bib0033","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s11222-024-10409-5","article-title":"Stochastic three-term conjugate gradient method with variance technique for non-convex learning","volume":"34","author":"Ouyang","year":"2024","journal-title":"Stat. Comput."},{"key":"10.1016\/j.cam.2026.117848_bib0034","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","article-title":"Global convergence properties of conjugate gradient methods for optimization","volume":"2","author":"Gilbert","year":"1992","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117848_bib0035","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10479-008-0420-4","article-title":"A modified PRP conjugate gradient method","volume":"166","author":"Yuan","year":"2009","journal-title":"Anna. Operat. Res."},{"key":"10.1016\/j.cam.2026.117848_bib0036","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.cam.2009.08.001","article-title":"A conjugate gradient method with descent direction for unconstrained optimization","volume":"233","author":"Yuan","year":"2009","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117848_bib0037","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.cam.2015.03.014","article-title":"A three-terms Polak-Ribi\u2018ere-Polyak conjugate gradient algorithm for large-scale nonlinear equations","volume":"286","author":"Yuan","year":"2015","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117848_bib0038","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/10556789308805532","article-title":"Analysis on the conjugate gradient method","author":"Yuan","year":"1993","journal-title":"Optim. Meth. Soft."},{"issue":"1","key":"10.1016\/j.cam.2026.117848_bib0039","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s11590-008-0086-5","article-title":"Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems","volume":"3","author":"Yuan","year":"2009","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cam.2026.117848_bib0040","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/1028154","article-title":"Convergence properties of algorithms for nonlinear optimization","volume":"28","author":"Powell","year":"1986","journal-title":"SIAM Rev."},{"key":"10.1016\/j.cam.2026.117848_bib0041","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02614362","article-title":"A globally convergent version of the Polak-Ribire conjugate gradient method","volume":"78","author":"Grippo","year":"1997","journal-title":"Math. Progra. Ser. A B."},{"key":"10.1016\/j.cam.2026.117848_bib0042","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1007\/s11075-019-00787-7","article-title":"Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions","volume":"84","author":"Yuan","year":"2020","journal-title":"Numer. Algo."},{"key":"10.1016\/j.cam.2026.117848_bib0043","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.engappai.2019.01.001","article-title":"The Sailfish optimizer: a novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems","volume":"80","author":"Shadravan","year":"2019","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0044","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1137\/140954362","article-title":"A stochastic Quasi-Newton method for large-scale optimization","volume":"26","author":"Byrd","year":"2014","journal-title":"SIAM J. Optim."},{"issue":"23","key":"10.1016\/j.cam.2026.117848_bib0045","doi-asserted-by":"crossref","first-page":"6089","DOI":"10.1109\/TSP.2014.2357775","article-title":"RES: regularized stochastic BFGS algorithm","volume":"62","author":"Mokhtari","year":"2014","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"10.1016\/j.cam.2026.117848_bib0046","first-page":"3151","article-title":"Global convergence of online limited memory BFGS","volume":"16","author":"Mokhtari","year":"2015","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"10.1016\/j.cam.2026.117848_bib0047","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","article-title":"Robust stochastic approximation approach to stochastic programming","volume":"19","author":"Nemirovski","year":"2009","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117848_bib0048","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/15M1053141","article-title":"Stochastic Quasi-Newton methods for nonconvex stochastic optimization","volume":"27","author":"Wang","year":"2017","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117848_bib0049","series-title":"Probability: Theory and Examples","author":"Durrett","year":"2010"},{"key":"10.1016\/j.cam.2026.117848_bib0050","doi-asserted-by":"crossref","first-page":"119818","DOI":"10.1109\/ACCESS.2021.3108418","article-title":"Stochastic bigger subspace algorithms for nonconvex stochastic optimization","volume":"9","author":"Yuan","year":"2021","journal-title":"IEEE Access"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004905?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004905?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:46Z","timestamp":1783036846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":50,"alternative-id":["S0377042726004905"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117848","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modified stochastic conjugate gradient algorithm in machine learning","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117848","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"117848"}}