{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T20:17:41Z","timestamp":1780517861513,"version":"3.54.1"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"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"}]},{"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"]}]},{"name":"Special Funds for Local Science and Technology Development Guided by the Central Government","award":["ZY20198003"],"award-info":[{"award-number":["ZY20198003"]}]},{"name":"Special Foundation for Guangxi Ba Gui Scholars"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3108418","type":"journal-article","created":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T20:04:50Z","timestamp":1630094690000},"page":"119818-119829","source":"Crossref","is-referenced-by-count":12,"title":["Stochastic Bigger Subspace Algorithms for Nonconvex Stochastic Optimization"],"prefix":"10.1109","volume":"9","author":[{"given":"Gonglin","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5724-9702","authenticated-orcid":false,"given":"Yingjie","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3855-3631","authenticated-orcid":false,"given":"Qingyuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drl016"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2371492"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2015.03.014"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2013.04.032"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0442-6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-018-9583-8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.01.013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.033"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.08.067"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS546"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11122-006-0005-2"},{"key":"ref35","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"johnson","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2868835"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.03.073"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/15M1053141"},{"key":"ref61","article-title":"Barzilai–Borwein step size for stochastic gradient descent","author":"tan","year":"2016","journal-title":"arXiv 1605 04131"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3178"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022558715350"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.11.150"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1132973.1132979"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-008-0086-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0420-4"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2009.08.001"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0781-1"},{"key":"ref2","article-title":"Non-strongly-convex smooth stochastic approximation with convergence rate $O(1\/n)$","author":"bach","year":"2013","journal-title":"arXiv 1306 2119"},{"key":"ref1","first-page":"595","article-title":"Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression","volume":"15","author":"bach","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/110848864"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0802003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/030601880"},{"key":"ref25","first-page":"1869","article-title":"Stochastic block BFGS: Squeezing more curvature out of data","author":"gower","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref50","author":"nesterov","year":"2003","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(69)90035-4"},{"key":"ref59","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref57","first-page":"436","article-title":"A stochastic quasi-Newton method for online convex optimization","author":"schraudolph","year":"2007","journal-title":"Proc Artif Intell Statist"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706619"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121128"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref53","first-page":"35","article-title":"Note sur la convergence de directions conjugees","volume":"3","author":"polak","year":"1969","journal-title":"ESAIM Math Modelling Numer Anal -Modélisation Mathématique et Analyse Numérique"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.irfa.2021.101676"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497318992"},{"key":"ref40","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets","author":"le roux","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/130936361"},{"key":"ref13","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/17442508308833246"},{"key":"ref17","volume":"1","author":"fletcher","year":"1997","journal-title":"Practical Methods of Optimization Unconstrained Optimization"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.149"},{"key":"ref19","first-page":"89","article-title":"Nonstationary stochastic programming problems","volume":"14","author":"gaivoronski","year":"1978","journal-title":"Cybernetics"},{"key":"ref4","article-title":"Online algorithms and stochastic approximations","author":"bottou","year":"1998","journal-title":"Online Learning and Neural Networks"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0708-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/140954362"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00031-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.najef.2021.101510"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728716"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref9","first-page":"378","article-title":"A modified Perry’s 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":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357775"},{"key":"ref45","first-page":"512","author":"mason","year":"1999","journal-title":"Boosting algorithms as gradient descent in function space"},{"key":"ref48","first-page":"249","article-title":"A linearly-convergent stochasitic L-BFGS algorithm","author":"moritz","year":"2016","journal-title":"Proc Artif Intell Statist"},{"key":"ref47","first-page":"3151","article-title":"Global convergence of online limited memory BFGS","volume":"16","author":"mokhtari","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940464"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref43","article-title":"A variance reduced stochastic Newton method","author":"lucchi","year":"2015","journal-title":"arXiv 1503 08316"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09524602.pdf?arnumber=9524602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:57:41Z","timestamp":1639771061000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9524602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3108418","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}