{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:31:38Z","timestamp":1754195498781,"version":"3.37.3"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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":[{"name":"NSF","award":["1903972","1935555","PIRE-2230630"],"award-info":[{"award-number":["1903972","1935555","PIRE-2230630"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tsipn.2023.3317807","type":"journal-article","created":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T17:52:58Z","timestamp":1695923578000},"page":"679-690","source":"Crossref","is-referenced-by-count":8,"title":["Distributed Saddle Point Problems for Strongly Concave-Convex Functions"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0661-4156","authenticated-orcid":false,"given":"Muhammad I.","family":"Qureshi","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, Tufts University, Medford, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0853-6518","authenticated-orcid":false,"given":"Usman A.","family":"Khan","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, Tufts University, Medford, MA, USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.006"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"article-title":"Distributed saddle point problems for strongly concave-convex functions","year":"2022","author":"qureshi","key":"ref56"},{"key":"ref15","first-page":"196","article-title":"Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity","author":"du","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref59","first-page":"2022","article-title":"Variance reduced stochastic optimization over directed graphs with row and column stochastic weights","author":"qureshi","year":"0"},{"key":"ref14","first-page":"1049","article-title":"Stochastic variance reduction methods for policy evaluation","author":"du","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3090652"},{"article-title":"On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization","year":"2009","author":"kakade","key":"ref53"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","article-title":"Distributed subgradient methods for multi-agent optimization","volume":"54","author":"nedi?","year":"2009","journal-title":"IEEE Trans Autom Control"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2182347"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74958-5_28"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791218"},{"article-title":"Finite-time distributed optimization with quantized gradient descent","year":"2022","author":"rikos","key":"ref54"},{"key":"ref17","first-page":"25865","article-title":"A faster decentralized algorithm for nonconvex minimax problems","author":"xian","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref16","first-page":"8172","article-title":"Distributed saddle-point problems under similarity","author":"beznosikov","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"2nd ed","year":"0","author":"ba?ar","key":"ref19"},{"journal-title":"Theory of Games and Economic Behavior","year":"1944","author":"neumann","key":"ref18"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3101015"},{"key":"ref50","first-page":"627","article-title":"A decentralized stochastic algorithm for coupled composite optimization with linear convergence","volume":"8","author":"l\u00fc","year":"2022","journal-title":"IEEE Trans Signal Inf Process Netw"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2020.101280"},{"key":"ref48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume":"137","author":"nesterov","year":"2018","journal-title":"Convex Optimization Lecture Notes"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref42","article-title":"Accelerated primal-dual gradient method for smooth and convex-concave saddle-point problems with bilinear coupling","author":"kovalev","year":"2022","journal-title":"Adv Neural Inf Process Syst"},{"article-title":"Distributed saddle-point problems: Lower bounds, near-optimal and robust algorithms","year":"2020","author":"beznosikov","key":"ref41"},{"key":"ref44","first-page":"1387","article-title":"Local stochastic gradient descent ascent: Convergence analysis and communication efficiency","volume":"130","author":"deng","year":"0","journal-title":"Proc Int Conf Artif Intell and Statist"},{"key":"ref43","first-page":"9672","article-title":"Multi-agent reinforcement learning via double averaging primal-dual optimization","author":"wai","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"key":"ref8","first-page":"6083","article-title":"On gradient descent ascent for nonconvex-concave minimax problems","author":"lin","year":"0","journal-title":"Proc 37th Int Conf Mach Learn"},{"key":"ref7","first-page":"2738","article-title":"Near-optimal algorithms for minimax optimization","author":"lin","year":"0","journal-title":"Proc 33rd Conf Learn Theory"},{"key":"ref9","first-page":"907","article-title":"Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks","volume":"89","author":"liang","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1969.7278"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.894402"},{"key":"ref6","article-title":"Certifiable distributional robustness with principled adversarial training","author":"sinha","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref5","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref40","article-title":"Optimal algorithms for decentralized stochastic variational inequalities","author":"kovalev","year":"2022","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref37","first-page":"4848","article-title":"D2: Decentralized training over decentralized data","author":"tang","year":"0","journal-title":"Proc the 35th Int Conf Mach Learn"},{"key":"ref36","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"0","journal-title":"Proc 30th Adv Int Conf Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/140990309"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3024266"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191450"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619336"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492904000212"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1117\/12.958573"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TAC.2011.2167817","article-title":"On distributed convex optimization under inequality and equality constraints","volume":"57","author":"zhu","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2925537"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782545"},{"key":"ref23","first-page":"5765","article-title":"Adversarially robust optimization with Gaussian processes","author":"bogunovic","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"ram","year":"2010","journal-title":"J Optim Theory Appl"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004477"},{"key":"ref20","first-page":"1497","article-title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","volume":"108","author":"mokhtari","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"article-title":"Gradient free minimax optimization: Variance reduction and faster convergence","year":"2021","author":"xu","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/18M1207260"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2737582"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"journal-title":"Introduction to Optimization","year":"1987","author":"polyak","key":"ref60"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1142\/SSVCSA"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413600"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6884276\/10040263\/10266914-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6884276\/10040263\/10266914.pdf?arnumber=10266914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:34:32Z","timestamp":1699904072000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10266914\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2023.3317807","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"type":"electronic","value":"2373-776X"},{"type":"electronic","value":"2373-7778"}],"subject":[],"published":{"date-parts":[[2023]]}}}