{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:56:16Z","timestamp":1761630976305,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","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"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","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,1]]},"DOI":"10.1109\/tac.2021.3135361","type":"journal-article","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T20:36:46Z","timestamp":1639514206000},"page":"156-171","source":"Crossref","is-referenced-by-count":6,"title":["Time-Variation in Online Nonconvex Optimization Enables Escaping From Spurious Local Minima"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1521-7566","authenticated-orcid":false,"given":"Yuhao","family":"Ding","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA, USA"}]},{"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9060-4032","authenticated-orcid":false,"given":"Murat","family":"Arcak","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9483303"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref3","first-page":"1724","article-title":"How to escape saddle points efficiently","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Jin","year":"2017"},{"key":"ref4","first-page":"797","article-title":"Escaping from saddle points-Online stochastic gradient for tensor decomposition","volume-title":"Proc. Conf. Learn. Theory","author":"Ge","year":"2015"},{"key":"ref5","first-page":"2698","article-title":"An alternative view: When does SGD escape local minima","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kleinberg","year":"2018"},{"key":"ref6","first-page":"184","article-title":"An algorithm for constrained maximization in nonlinear programming","volume":"17","author":"Tanabe","year":"1974","journal-title":"J. Operations Res. Soc. Japan"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1109\/TCNS.2021.3084039","article-title":"Smoothing property of load variation promotes finding global solutions of time-varying optimal power flow","volume-title":"IEEE Trans. Control Netw. Syst.","author":"Mulvaney-Kemp","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2017.2704922"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618660"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2002.808470"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04331-8_18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2328981"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2420535"},{"key":"ref14","first-page":"593","article-title":"Towards integrated dynamic real-time optimization and control of industrial processes","volume-title":"Proc. Found. Comput.-Aided Process Operations","author":"Kadam","year":"2003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2009.07.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2568161"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798732"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2896112"},{"article-title":"Time-varying convex optimization via time-varying averaged operators","year":"2017","author":"Simonetto","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-12160-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/20m1371063"},{"article-title":"On-line non-convex constrained optimization","year":"2019","author":"Massicot","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CCTA41146.2020.9206163"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20132"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref27","first-page":"6389","article-title":"Visualizing the loss landscape of neural nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li","year":"2018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2011.2160974"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01374-3"},{"key":"ref30","first-page":"3873","article-title":"Global optimality of local search for low rank matrix recovery","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bhojanapalli","year":"2016"},{"key":"ref31","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ge","year":"2016"},{"key":"ref32","first-page":"1","article-title":"Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery","volume":"20","author":"Zhang","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","first-page":"1","article-title":"Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis","volume-title":"J. Mach. Learn. Res.","volume":"21","author":"Fattahi","year":"2018"},{"key":"ref34","first-page":"2441","article-title":"A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Josz","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2632162"},{"volume-title":"Nonlinear Systems","year":"2002","author":"Khalil","key":"ref36"},{"volume-title":"Ordinary Differential Equations","year":"1980","author":"Hale","key":"ref37"},{"key":"ref38","first-page":"2510","article-title":"A differential equation for modeling Nesterovs accelerated gradient method: Theory and insights","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Su","year":"2014"},{"key":"ref39","first-page":"2845","article-title":"Accelerated mirror descent in continuous and discrete time","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Krichene","year":"2015"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1614734113"},{"key":"ref41","article-title":"Exact solutions to the nonlinear dynamics of learning in deep linear neural networks","volume-title":"Int. Conf. Learn. Representations","author":"Saxe","year":"2014"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503198"},{"journal-title":"Nonlinear Program","year":"2016","author":"Bertsekas","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1942-07811-6"},{"key":"ref45","article-title":"Lectures on parametric optimization: An introduction","volume-title":"Optim. Online","author":"Still","year":"2018"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0109044"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.11.620"},{"article-title":"Time-variation in online nonconvex optimization enables escaping from spurious local minima","year":"2020","author":"Ding","key":"ref48"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511995569"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6911(99)00039-0"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(99)00012-6"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s004980200002"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1997-9"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/10002258\/9650742-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/10002258\/09650742.pdf?arnumber=9650742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T20:17:43Z","timestamp":1708978663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9650742\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":53,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tac.2021.3135361","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,1]]}}}