{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:31:56Z","timestamp":1753601516389,"version":"3.37.3"},"reference-count":38,"publisher":"IEEE","funder":[{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"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":"AFOSR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,25]]},"DOI":"10.23919\/acc50511.2021.9482986","type":"proceedings-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T20:29:16Z","timestamp":1627504156000},"page":"978-985","source":"Crossref","is-referenced-by-count":2,"title":["Diminishing Regret for Online Nonconvex Optimization"],"prefix":"10.23919","author":[{"given":"SangWoo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julie","family":"Mulvaney-Kemp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Random Allocations Washington D C Winston","year":"1978","author":"kolchin","key":"ref38"},{"journal-title":"How many random restarts are enough?","year":"2014","author":"dick","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494277317"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591684"},{"key":"ref37","first-page":"1","article-title":"On the convergence rate of good-turing estimators","author":"mcallester","year":"2000","journal-title":"Conference on Learning Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852234"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-12160-2"},{"journal-title":"On-line non-convex constrained optimization","year":"2019","author":"massicot","key":"ref11"},{"key":"ref12","article-title":"Escaping spurious local minimum trajectories in online time-varying nonconvex optimization","author":"ding","year":"2019","journal-title":"ArXiv Preprint"},{"journal-title":"On the absence of spurious local trajectories in online nonconvex optimization","year":"2019","author":"fattahi","key":"ref13"},{"key":"ref14","article-title":"Smoothing property of load variation promotes finding global solutions of time-varying optimal power flow","author":"mulvaney-kemp","year":"2020","journal-title":"to appear in IEEE Trans Control Netw Syst"},{"key":"ref15","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 7th Int Conf Machine Learning"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2933841"},{"key":"ref17","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","volume":"38","author":"jadbabaie","year":"2015","journal-title":"Artificial Intelligence and Statistics Proc of Machine Learning Research"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3040372"},{"journal-title":"Introduction to Online Convex Optimization","year":"2019","author":"hazan","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2002.808470"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219635"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2328981"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_12"},{"key":"ref5","article-title":"Conic relaxations of power system optimization: Theory and algorithms","author":"zohrizadeh","year":"2020","journal-title":"To appear in European Journal of Operational Research"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"2963","DOI":"10.1109\/TSG.2017.2704922","article-title":"Real-time optimal power flow","volume":"8","author":"tang","year":"2017","journal-title":"IEEE Trans on Smart Grid"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref1","first-page":"6389","article-title":"Visualizing the loss landscape of neural nets","author":"li","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2568161"},{"key":"ref22","article-title":"Online primal-dual methods with measurement feedback for time-varying convex optimization","author":"bernstein","year":"2018","journal-title":"Conf on Decision and Control"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798732"},{"key":"ref24","first-page":"1","article-title":"Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit","author":"li","year":"2020","journal-title":"IEEE Trans on Automatic Control"},{"journal-title":"Time-Varying Convex Optimization via Time-Varying Averaged Operators","year":"2017","author":"simonetto","key":"ref23"},{"journal-title":"Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems","year":"2017","author":"tang","key":"ref26"},{"key":"ref25","first-page":"2278","article-title":"Efficient regret minimization in non-convex games","volume":"3","author":"hazan","year":"2017","journal-title":"Int Conf on Machine Learning"}],"event":{"name":"2021 American Control Conference (ACC)","start":{"date-parts":[[2021,5,25]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2021,5,28]]}},"container-title":["2021 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9482409\/9482614\/09482986.pdf?arnumber=9482986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T10:51:24Z","timestamp":1633517484000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9482986\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":38,"URL":"https:\/\/doi.org\/10.23919\/acc50511.2021.9482986","relation":{},"subject":[],"published":{"date-parts":[[2021,5,25]]}}}