| [1]Nesterov Y.Introductory Lectures on Convex Optimization[M]. Springer Science Business Media, 2013.[2]Goodfellow I, Pouget-Abadie J, Mirza M.Generative adversarial nets[C]. Advances in neural information processing systems. 2014: 2672-2680.[3] Sinha A, Namkoong H, Duchi J. Certifiable distributional robustness with principled adver-sarial training[J]. arXiv:1710.10571, 2017.[4] Jordan M. Artifficial intelligence the revolution hasn't happened yet[J]. Perspectives and Challenges. Presentation SysML, 2018.[5] Shamma J. Cooperative control of distributed multi-agent systems[M]. John Wiley & Sons,2008.[6] Mateos G, Bazerque J A, Giannakis G B. Distributed sparse linear regression[J]. IEEE Transactions on Signal Processing, 2010, 58(10): 5262-5276.[7] Nemirovski A. Prox-method with rate of convergence O (1/t) for variational inequalities withLipschitz continuous monotone operators and smooth convex-concave saddle point problems[J].SIAM Journal on Optimization, 2004, 15(1): 229-251.[8] Nesterov Y. Dual extrapolation and its applications to solving variational inequalities andrelated problems[J]. Mathematical Programming, 2007, 109(2-3): 319-344.[9] Tseng P. On accelerated proximal gradient methods for convex-concave optimization[J]. submitted to SIAM Journal on Optimization, 2008.[10] Korpelevich G M. The extragradient method for nding saddle points and other problems[J]. Matecon, 1976, 12: 747-756.[11] Ouyang Y, Xu Y. Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems[J]. Mathematical Programming, 2019: 1-35.[12] Nouiehed M, Sanjabi M, Huang T, Lee J.D. Solving a Class of nonconvex Min-Max Games Using Iterative First Order Methods[J]. arXiv:1902.08297, 2019.[13] Thekumparampil K K, Jain P, Netrapalli P. Efficient algorithms for smooth minimax optimization[C]. Advances in Neural Information Processing Systems. 2019: 12680-12691.[14] Lin T, Jin C, Jordan M. On gradient descent ascent for nonconvex-concave minimax problems[J]. arXiv:1906.00331, 2019.[15] Lin T, Jin C, Jordan M. Near-optimal algorithms for minimax optimization[J]. arXiv:2002.02417, 2020.[16] Lu S, Tsaknakis I, Hong M, Chen Y. Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications[J]. IEEE Transactions on Signal Processing, 2020.[17] Xu Z, Zhang H, Xu Y, Lan G. A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems[J]. arXiv:2006.02032, 2020. |
