{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:07:49Z","timestamp":1740132469618,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1708906","ECCS-1809833"],"award-info":[{"award-number":["ECCS-1708906","ECCS-1809833"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/tac.2022.3162154","type":"journal-article","created":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T21:24:37Z","timestamp":1648157077000},"page":"1823-1830","source":"Crossref","is-referenced-by-count":7,"title":["Transient Growth of Accelerated Optimization Algorithms"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3030-1536","authenticated-orcid":false,"given":"Hesameddin","family":"Mohammadi","sequence":"first","affiliation":[{"name":"Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4797-6302","authenticated-orcid":false,"given":"Samantha","family":"Samuelson","sequence":"additional","affiliation":[{"name":"Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4181-2924","authenticated-orcid":false,"given":"Mihailo R.","family":"Jovanovi\u0107","sequence":"additional","affiliation":[{"name":"Ming Hsieh Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA"}],"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.1137\/080716542"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2481563"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2257618"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2674962"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2948268"},{"key":"ref9","first-page":"1139","article-title":"On the importance of initialization and momentum in deep learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sutskever","year":"2013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref11","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate $O(1\/k^{2})$","volume":"27","author":"Nesterov","year":"1983","journal-title":"Proc. USSR Akad. Sci."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"ref14","first-page":"1549","article-title":"Dissipativity theory for Nesterovs accelerated method","author":"Hu","year":"2017","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619183"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8814680"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008297"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2020.1745286"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.109361"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9150-3"},{"volume-title":"Convex optimization Algorithms","year":"2015","author":"Bertsekas","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/14095697X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1515\/9780691213101"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S0022112005004295"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-fluid-010719-060244"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.23919\/ACC45564.2020.9147427"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304412"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1134\/S0005117919090066"},{"key":"ref30","first-page":"891","article-title":"Accelerated linear convergence of stochastic momentum methods in Wasserstein distances","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Can","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/17M1136845"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009597"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.20537\/2076-7633-2022-14-2-277-308"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/9.587335"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8430824"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2867589"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.109311"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.1513"},{"key":"ref40","first-page":"137","article-title":"Some bounds for the logarithmic function","volume":"4","author":"Topsok","year":"2006","journal-title":"Inequality Theory Appl."}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10056266\/9741291-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10056266\/09741291.pdf?arnumber=9741291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:27:39Z","timestamp":1705537659000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9741291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3162154","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"type":"print","value":"0018-9286"},{"type":"electronic","value":"1558-2523"},{"type":"electronic","value":"2334-3303"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}