{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:39:00Z","timestamp":1773718740793,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARO"},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1109\/tcns.2022.3203798","type":"journal-article","created":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T19:48:46Z","timestamp":1662148126000},"page":"599-611","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic Regret Bounds for Constrained Online Nonconvex Optimization Based on Polyak\u2013Lojasiewicz Regions"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1602-8721","authenticated-orcid":false,"given":"Julie","family":"Mulvaney-Kemp","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0355-7272","authenticated-orcid":false,"given":"SangWoo","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7909-4545","authenticated-orcid":false,"given":"Ming","family":"Jin","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4294-1338","authenticated-orcid":false,"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"6389","article-title":"Visualizing the loss landscape of neural nets","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Li","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2002.808470"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.01.034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2328981"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2017.2704922"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref10","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","volume-title":"Proc. 18th Int. Conf. Artif. Intell. Statist.","author":"Jadbabaie","year":"2015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16858"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3107480"},{"key":"ref13","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zinkevich","year":"2003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref15","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Yang","year":"2016"},{"key":"ref16","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang","year":"2017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3224420"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15883-4_20"},{"issue":"10","key":"ref20","first-page":"2903","article-title":"Online submodular minimization","volume":"13","author":"Hazan","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9589"},{"key":"ref22","first-page":"235","article-title":"Online learning with non-convex losses and non-stationary regret","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Gao","year":"2018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3040372"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9482986"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9483303"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CCTA41146.2020.9206163"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"issue":"4","key":"ref28","first-page":"643","article-title":"Gradient methods for minimizing functionals","volume":"3","author":"Polyak","year":"1963","journal-title":"Zh Vychisl. Mat. Mat. Fiz."},{"key":"ref29","first-page":"1467","article-title":"Global convergence of policy gradient methods for the linear quadratic regulator","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Fazel","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-87821-8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-019-0504-0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2009.04.060"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2301-7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/18M1229225"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6509490\/10155497\/9875003-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6509490\/10155497\/09875003.pdf?arnumber=9875003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T12:51:35Z","timestamp":1706791895000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9875003\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2022.3203798","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"value":"2325-5870","type":"electronic"},{"value":"2372-2533","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]}}}