{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:41:02Z","timestamp":1729611662260,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262738","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"198-203","source":"Crossref","is-referenced-by-count":1,"title":["On stochastic proximal-point method for convex-composite optimization"],"prefix":"10.1109","author":[{"given":"Angelia","family":"Nedic","sequence":"first","affiliation":[]},{"given":"Tatiana","family":"Tatarenko","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","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 27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref10","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Advances in Neural Information Processing Systems 24"},{"key":"ref6","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"NIPS"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973433","author":"shapiro","year":"2014","journal-title":"Lectures on Stochastic Programming Modeling and Theory"},{"key":"ref5","first-page":"2899","article-title":"Efficient online and batch learning using forward backward splitting","volume":"10","author":"duchi","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2578323"},{"journal-title":"Gradient methods for minimizing composite objective function CORE Discussion Papers 2007076","year":"2007","author":"nesterov","key":"ref8"},{"key":"ref7","first-page":"263","article-title":"Convergence rate of incremental subgradient algorithms stochastic optimization","author":"nedi?","year":"2000","journal-title":"Algorithms and Applications"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref1","first-page":"1","article-title":"Information-theoretic lower bounds on the oracle complexity of convex optimization","author":"agarwal","year":"2009","journal-title":"Advances in Neural Information Processing Systems 22"}],"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\/08262738.pdf?arnumber=8262738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,25]],"date-time":"2020-10-25T20:54:35Z","timestamp":1603659275000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262738","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}