{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:47:44Z","timestamp":1729648064436,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262782","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T18:03:47Z","timestamp":1516298627000},"page":"526-532","source":"Crossref","is-referenced-by-count":4,"title":["Curvature-aided incremental aggregated gradient method"],"prefix":"10.1109","author":[{"given":"Hoi-To","family":"Wai","sequence":"first","affiliation":[]},{"given":"Wei","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Angelia","family":"Nedic","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Scaglione","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"263","article-title":"Convergence rate of incremental subgradient algorithms stochastic optimization","author":"nedi?","year":"2000","journal-title":"Algorithms and Applications"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","article-title":"Incremental subgradient methods for nondifferentiable optimization","volume":"12","author":"nedi?","year":"2001","journal-title":"SIAM Journal on Optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-579X(01)80023-9"},{"key":"ref13","first-page":"2597","article-title":"A superlinearly-convergent proximal newton-type method for the optimization of finite sums","author":"rodomanov","year":"2016","journal-title":"International Conference on Machine Learning"},{"journal-title":"Iqn An incremental quasi-newton method with local superlinear convergence rate","year":"2017","author":"mokhtari","key":"ref14"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref15"},{"key":"ref16","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref4","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref3","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence _rate for finite training sets","author":"roux","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/040615961"},{"key":"ref5","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":"Advances in neural information processing systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/15M1049695"},{"journal-title":"A stronger convergence result on the proximal incremental aggregated gradient method","year":"2016","author":"vanli","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref1","first-page":"3","article-title":"Incremental gradient, subgradient, and proximal methods for convex optimization: A survey","volume":"2010","author":"bertsekas","year":"2011","journal-title":"Optimization for Machine Learning"},{"journal-title":"Surpassing gradient descent provably A cyclic incremental method with linear convergence rate","year":"2016","author":"mokhtari","key":"ref9"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262782.pdf?arnumber=8262782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T10:43:38Z","timestamp":1570617818000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262782","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}