{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:21:47Z","timestamp":1764588107432,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9054474","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"3162-3166","source":"Crossref","is-referenced-by-count":5,"title":["Solving Non-Convex Non-Differentiable Min-Max Games Using Proximal Gradient Method"],"prefix":"10.1109","author":[{"given":"Babak","family":"Barazandeh","sequence":"first","affiliation":[]},{"given":"Meisam","family":"Razaviyayn","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1137\/080716542"},{"year":"1967","author":"danskin","journal-title":"The theory of max-min economtrics and operations research 5","key":"ref32"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1016\/0362-546X(94)00186-L"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1017\/CBO9781316162750.005"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/GlobalSIP.2018.8646506"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1073\/pnas.36.1.48"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/BF02592948"},{"key":"ref13","first-page":"3066","article-title":"Optimization, learning, and games with predictable sequences","author":"rakhlin","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref14","article-title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","author":"mertikopoulos","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref15","article-title":"Last-iterate convergence: Zero-sum games and constrained min-max optimization","author":"daskalakis","year":"2019","journal-title":"Innovations in Theoretical Computer Science"},{"year":"2019","author":"mokhtari","article-title":"A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach","key":"ref16"},{"key":"ref17","first-page":"362","article-title":"Frank-Wolfe algorithms for saddle point problems","author":"gidel","year":"2017","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref18","first-page":"6584","article-title":"On Frank-Wolfe and equilibrium computation","author":"abernethy","year":"2017","journal-title":"Advances in neural information processing systems"},{"year":"2018","author":"hamedani","article-title":"Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems","key":"ref19"},{"year":"2020","author":"wang","article-title":"Zeroth-order algorithms for nonconvex minimax problems with improved complexities","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/DSW.2019.8755568"},{"year":"2019","author":"liu","article-title":"Min-max optimization without gradients: Convergence and applications to adversarial ML","key":"ref27"},{"key":"ref3","first-page":"7091","article-title":"On the convergence and robustness of training gans with regularized optimal transport","author":"sanjabi","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref6","first-page":"3384","article-title":"Learning adversarially fair and transferable representations","author":"madras","year":"2018","journal-title":"International Conference on Machine Learning"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/BF01582255"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/BigData.2018.8622525"},{"key":"ref8","article-title":"Towards deep learning models resistant to adversarial attacks","author":"madry","year":"2018","journal-title":"International Conference on Learning Representations"},{"key":"ref7","article-title":"Rényi fair inference","author":"baharlouei","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"ref2","first-page":"5767","article-title":"Improved training of Wasserstein Gans","author":"gulrajani","year":"2017","journal-title":"Advances in neural information processing systems"},{"year":"2013","author":"berger","journal-title":"Statistical Decision Theory and Bayesian Analysis","key":"ref9"},{"key":"ref1","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Advances in neural information processing systems"},{"year":"2018","author":"rafique","article-title":"Non-convex minmax optimization: Provable algorithms and applications in machine learning","key":"ref20"},{"year":"2019","author":"lu","article-title":"Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications","key":"ref22"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/ICASSP.2019.8683795"},{"key":"ref24","first-page":"12659","article-title":"Efficient algorithms for smooth minimax optimization","author":"thekumparampil","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref23","first-page":"14905","article-title":"Solving a class of non-convex min-max games using iterative first order methods","author":"nouiehed","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref26","first-page":"5","article-title":"Introductory lectures on convex programming volume i: Basic course","volume":"3","author":"nesterov","year":"1998","journal-title":"Lecture notes"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1214\/10-SSY011"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09054474.pdf?arnumber=9054474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:08:05Z","timestamp":1656374885000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9054474\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9054474","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}