{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:15:43Z","timestamp":1774541743290,"version":"3.50.1"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Center for International Scientific Studies & Collaborations"},{"DOI":"10.13039\/501100008798","name":"Ministry of Science Research and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008798","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tnse.2024.3439744","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T17:53:40Z","timestamp":1723053220000},"page":"6461-6469","source":"Crossref","is-referenced-by-count":31,"title":["Nonlinear Perturbation-Based Non-Convex Optimization Over Time-Varying Networks"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0959-6608","authenticated-orcid":false,"given":"Mohammadreza","family":"Doostmohammadian","sequence":"first","affiliation":[{"name":"Faculty of Mechanical Engineering, Semnan University, Semnan, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3573-3979","authenticated-orcid":false,"given":"Zulfiya R.","family":"Gabidullina","sequence":"additional","affiliation":[{"name":"Institute of Computational Mathematics and Information Technologies, Kazan Federal University, Kazan, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9835-4493","authenticated-orcid":false,"given":"Hamid R.","family":"Rabiee","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Sharif University of Technology, Tehran, Iran"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3073066"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-00832-0_3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2956546"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3018871"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3086388"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2438032"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2089653"},{"key":"ref8","first-page":"19638","article-title":"Analysis of error feedback in federated non-convex optimization with biased compression: Fast convergence and partial participation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2023.3303219"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.segan.2023.101136"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2023.3317807"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191450"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2363554"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3342165"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2024.3364097"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906495"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/OJCSYS.2022.3210453"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3300736"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2023.105657"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2023.10.100"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3001436"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303778"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2024.3383894"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3122586"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3050858"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02328-8"},{"key":"ref30","first-page":"1497","article-title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Mokhtari"},{"key":"ref31","first-page":"5485","article-title":"Faster single-loop algorithms for minimax optimization without strong concavity","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Yang"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637317"},{"key":"ref33","first-page":"3215","article-title":"NESTT: A nonconvex primal-dual splitting method for distributed and stochastic optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hajinezhad","year":"2016"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108245"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110353"},{"key":"ref36","first-page":"5765","article-title":"Adversarially robust optimization with Gaussian processes","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bogunovic","year":"2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003837"},{"key":"ref38","first-page":"6702","article-title":"Zeroth-order methods for convex-concave min-max problems: Applications to decision-dependent risk minimization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Maheshwari"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.23919\/ACC53348.2022.9867306"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/20M1361158"},{"key":"ref41","first-page":"9217","article-title":"Improving the sample and communication complexity for decentralized non-convex optimization: Joint gradient estimation and tracking","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sun","year":"2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3062553"},{"key":"ref43","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":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref45","first-page":"31653","article-title":"BEER: Fast $ O (1\/T)$ rate for decentralized nonconvex optimization with communication compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhao","year":"2022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02328-8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3239799"},{"key":"ref48","first-page":"1849","article-title":"Stochastic distributed optimization under average second-order similarity: Algorithms and analysis","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lin","year":"2024"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887293"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9992434"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2254478"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426252"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/060676866"},{"key":"ref55","volume-title":"Matrix Perturbation Theory","author":"Stewart","year":"1990"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.003"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719079"},{"key":"ref58","volume-title":"Appl. Nonlinear Control","author":"Slotine","year":"1991"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2020.2965811"},{"key":"ref60","first-page":"344","article-title":"Stochastic gradient push for distributed deep learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Assran","year":"2019"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3292860"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3135834"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/10758414\/10629194.pdf?arnumber=10629194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:18:01Z","timestamp":1732666681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10629194\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":63,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2024.3439744","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}