{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:53:06Z","timestamp":1757613186438,"version":"3.44.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.23919\/acc.2019.8814680","type":"proceedings-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T18:42:46Z","timestamp":1574707366000},"page":"3426-3431","source":"Crossref","is-referenced-by-count":9,"title":["Performance of noisy Nesterov's accelerated method for strongly convex optimization problems"],"prefix":"10.23919","author":[{"given":"Hesameddin","family":"Mohammadi","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meisam","family":"Razaviyayn","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, 90089"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihailo R.","family":"Jovanovi\u0107","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/asmb.538"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2481563"},{"issue":"2","key":"ref3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M1080173","article-title":"Optimization methods for large-scale machine learning","volume":"60","author":"Bottou","year":"2018","journal-title":"SIAM Rev."},{"key":"ref4","first-page":"1139","article-title":"On the importance of initialization and momentum in deep learning","volume-title":"Proc. ICML","author":"Sutskever","year":"2013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"issue":"2","key":"ref6","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O (1\/k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref9","volume-title":"Introductory lectures on convex optimization: A basic course","volume":"87","author":"Nesterov","year":"2013"},{"key":"ref10","first-page":"2113","article-title":"Gradient-based hyperparameter optimization through reversible learning","volume-title":"Proc. ICML","author":"Maclaurin","year":"2015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015187"},{"key":"ref12","first-page":"3458","article-title":"On optimal generalizability in parametric learning","volume-title":"Proc. Neural Information Processing (NIPS)","author":"Beirami","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2202052"},{"key":"ref14","first-page":"797","article-title":"Escaping from saddle points-online stochastic gradient for tensor decomposition","volume-title":"Conference on Learning Theory","author":"Ge","year":"2015"},{"key":"ref15","first-page":"1724","article-title":"How to escape saddle points efficiently","volume-title":"Proceedings of the 34th International Conference on Machine Learning, PMLR 70","author":"Jin","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096261"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"issue":"1","key":"ref20","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."},{"issue":"1","key":"ref21","first-page":"3520","article-title":"Harder, better, faster, stronger convergence rates for least-squares regression","volume":"18","author":"Dieuleveut","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","first-page":"451","article-title":"Non-asymptotic analysis of stochastic approximation algorithms for machine learning","volume-title":"Proc. Neural Information Processing (NIPS)","author":"Moulines","year":"2011"},{"volume-title":"Aver-aging stochastic gradient descent on Riemannian manifolds","year":"2018","author":"Tripuraneni","key":"ref23"},{"key":"ref24","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","volume-title":"Proc. Neural Information Processing (NIPS)","author":"Schmidt","year":"2011"},{"key":"ref25","article-title":"Estimate sequence methods: extensions and approximations","volume-title":"IFOR Internal report","author":"Baes","year":"2009"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/060676386"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/140994964"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619183"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009597"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/17M1136845"},{"key":"ref31","first-page":"1549","article-title":"Dissipativity theory for Nesterov\u2019s accelerated method","volume-title":"Proceedings of the 34th International Conference on Machine Learning, PMLR 70","author":"Hu","year":"2017"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8430824"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2867589"}],"event":{"name":"2019 American Control Conference (ACC)","start":{"date-parts":[[2019,7,10]]},"location":"Philadelphia, PA, USA","end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8789884\/8814292\/08814680.pdf?arnumber=8814680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T18:19:51Z","timestamp":1757009991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8814680\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.23919\/acc.2019.8814680","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}