{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:57:43Z","timestamp":1761631063251,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72201007","723B1001","T2121002","72131001"],"award-info":[{"award-number":["72201007","723B1001","T2121002","72131001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF through Global Center Grant","award":["90107717"],"award-info":[{"award-number":["90107717"]}]},{"DOI":"10.13039\/501100001809","name":"Johns Hopkins University IAA Grant Challenge","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/lcsys.2024.3413004","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T18:50:24Z","timestamp":1718131824000},"page":"2009-2014","source":"Crossref","is-referenced-by-count":1,"title":["Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-Max Optimization"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1332-5837","authenticated-orcid":false,"given":"Tianqi","family":"Zheng","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Loizou","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1532-8773","authenticated-orcid":false,"given":"Pengcheng","family":"You","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering and Management, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1568-1833","authenticated-orcid":false,"given":"Enrique","family":"Mallada","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","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":"ref2","first-page":"2863","article-title":"A tight and unified analysis of gradient-based methods for a whole spectrum of differentiable games","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Azizian"},{"key":"ref3","first-page":"19095","article-title":"Stochastic gradient descent-ascent and consensus optimization for smooth games: Convergence analysis under expected co-coercivity","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Loizou"},{"key":"ref4","first-page":"172","article-title":"Stochastic gradient descent-ascent: Unified theory and new efficient methods","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Beznosikov"},{"key":"ref5","article-title":"A variational inequality perspective on generative adversarial networks","author":"Gidel","year":"2018","journal-title":"arXiv:1802.10551"},{"key":"ref6","first-page":"1","article-title":"Generative adversarial nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Goodfellow"},{"key":"ref7","article-title":"Training GANs with optimism","author":"Daskalakis","year":"2017","journal-title":"arXiv:1711.00141"},{"key":"ref8","article-title":"Connecting generative adversarial networks and actor-critic methods","author":"Pfau","year":"2016","journal-title":"arXiv:1610.01945"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF56349.2022.10052060"},{"key":"ref10","article-title":"Last-iterate convergent policy gradient primal-dual methods for constrained MDPs","author":"Ding","year":"2023","journal-title":"arXiv:2306.11700"},{"key":"ref11","first-page":"1","article-title":"Banach wasserstein GAN","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Adler"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1201\/9781315140223"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1193-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431231"},{"key":"ref15","first-page":"1549","article-title":"Dissipativity theory for Nesterov\u2019s accelerated method","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hu"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/17M1136845"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009597"},{"issue":"1","key":"ref18","first-page":"4648","article-title":"A unified analysis of first-order methods for smooth games via integral quadratic constraints","volume":"22","author":"Zhang","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2024.3383894"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/ACC50511.2021.9483346"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(94)00094-H"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2019.1000"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01910-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref26","first-page":"2738","article-title":"Near-optimal algorithms for minimax optimization","volume-title":"Proc. 33rd Conf. Learn. Theory","author":"Lin"},{"key":"ref27","first-page":"7377","article-title":"A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhang"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01919-z"},{"key":"ref29","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":"ref30","first-page":"1","article-title":"Universal gradient descent ascent method for nonconvex-nonconcave minimax optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Zheng"},{"key":"ref31","first-page":"25865","article-title":"A faster decentralized algorithm for nonconvex minimax problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Xian"},{"issue":"36","key":"ref32","first-page":"1","article-title":"Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization","volume":"23","author":"Huang","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","first-page":"1","article-title":"Convergence of gradient methods on bilinear zero-sum games","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.23943\/9781400890088"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.4171\/mag\/112"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7782633\/10411713\/10554660.pdf?arnumber=10554660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T17:41:19Z","timestamp":1729791679000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10554660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2024.3413004","relation":{},"ISSN":["2475-1456"],"issn-type":[{"type":"electronic","value":"2475-1456"}],"subject":[],"published":{"date-parts":[[2024]]}}}