{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T13:34:49Z","timestamp":1780580089140,"version":"3.54.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"23","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"ARO","award":["W911NF-10-1-0388"],"award-info":[{"award-number":["W911NF-10-1-0388"]}]},{"name":"NSF CAREER","award":["CCF-0952867"],"award-info":[{"award-number":["CCF-0952867"]}]},{"name":"ONR","award":["N00014-12-1-0997"],"award-info":[{"award-number":["N00014-12-1-0997"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/tsp.2014.2357775","type":"journal-article","created":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T01:11:47Z","timestamp":1410916307000},"page":"6089-6104","source":"Crossref","is-referenced-by-count":113,"title":["RES: Regularized Stochastic BFGS Algorithm"],"prefix":"10.1109","volume":"62","author":[{"given":"Aryan","family":"Mokhtari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alejandro","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref30","author":"solo","year":"1995","journal-title":"Adaptive Signal Processing Algorithms Stability and Performance"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref12","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets","author":"roux","year":"2012","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref13","author":"schmidt","year":"2013","journal-title":"?Minimizing finite sums with the stochastic average gradient ?"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1109\/TAC.1983.1103184","article-title":"Stochastic approximation method with gradient averaging for unconstrained problems","volume":"28","author":"syski","year":"1983","journal-title":"IEEE Trans Autom Control"},{"key":"ref16","author":"konecny","year":"2013","journal-title":"?Semi-stochastic gradient descent methods ?"},{"key":"ref17","first-page":"980","article-title":"Linear convergence with condition number independent access of full gradients","author":"zhang","year":"2013","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref18","author":"birge","year":"1995","journal-title":"?A stochastic Newton method for stochastic quadratic programs with resource ?"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2013.6831412"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/12.3.223"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/130385.130401"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/asmb.538"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2013.6612004"},{"key":"ref29","author":"fletcher","year":"2013","journal-title":"Practical Methods of Optimizations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390273"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1499-2012-272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2057247"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6855220"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273598"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6737088"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0343581-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0724077"},{"key":"ref21","author":"powell","year":"1971","journal-title":"Some Global Convergence Properties of A Variable Metric Algorithm for Minimization Without Exact Line Search"},{"key":"ref24","first-page":"433","article-title":"A stochastic quasi-newton method for online convex optimization","author":"schraudolph","year":"2007","journal-title":"Proc 11th Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"ref26","author":"vapnik","year":"1999","journal-title":"The Nature of Statistical Learning Theory"},{"key":"ref25","first-page":"1737","article-title":"SGD-QN: Careful quasi-Newton stochastic gradient descent","volume":"10","author":"bordes","year":"2009","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/6940343\/06899692.pdf?arnumber=6899692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:05:44Z","timestamp":1642003544000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6899692\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":31,"journal-issue":{"issue":"23"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2014.2357775","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]}}}