{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T14:17:12Z","timestamp":1790691432656,"version":"4.1.0"},"reference-count":23,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/501100001809","name":"Chinese NSF","doi-asserted-by":"publisher","award":["11631013"],"award-info":[{"award-number":["11631013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Chinese NSF","doi-asserted-by":"publisher","award":["11991021"],"award-info":[{"award-number":["11991021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Chinese NSF","doi-asserted-by":"publisher","award":["11971372"],"award-info":[{"award-number":["11971372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Chinese NSF","doi-asserted-by":"publisher","award":["11991020"],"award-info":[{"award-number":["11991020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Chinese NSF","doi-asserted-by":"publisher","award":["11501569"],"award-info":[{"award-number":["11501569"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Chinese NSF","doi-asserted-by":"publisher","award":["61571008"],"award-info":[{"award-number":["61571008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2020,9,2]]},"DOI":"10.1080\/10556788.2020.1754414","type":"journal-article","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T07:49:56Z","timestamp":1587023396000},"page":"955-973","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":14,"title":["Training GANs with centripetal acceleration"],"prefix":"10.1080","volume":"35","author":[{"given":"Wei","family":"Peng","sequence":"first","affiliation":[{"name":"National Innovation Institute of Defense Technology, Chinese Academy of Military Science, Beijing, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[{"name":"Academy of Mathematics and Systems Science, Chinese Academy of Sciences, LSEC, ICMSEC, Beijing, People's Republic of China"},{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National University of Defense Technology, Changsha, Hunan, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lizhi","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National University of Defense Technology, Changsha, Hunan, People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,4,16]]},"reference":[{"key":"CIT0001","unstructured":"L. Adolphs, H. Daneshmand, A. Lucchi, and T. Hofmann, Local saddle point optimization: A curvature exploitation approach.arXiv preprint arXiv:1805.05751, 2018."},{"key":"CIT0002","unstructured":"D. Balduzzi, S. Racaniere, J. Martens, J. Foerster, K. Tuyls, and T. Graepel,The mechanics ofn-player differentiable games, International Conference on Machine Learning, Stockholmsm\u00e4ssan, Stockholm Swede, 2018, pp. 363\u2013372."},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"CIT0004","unstructured":"T. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman,Project adam: Building an efficient and scalable deep learning training system, Proceedings of the 11th USENIX conference on Operating Systems Design and Implementation, USENIX Association, Broomfield, CO, 2014, pp. 571\u2013582."},{"issue":"2","key":"CIT0005","doi-asserted-by":"crossref","first-page":"181","DOI":"10.3934\/jimo.2005.1.181","volume":"1","author":"Dai Y.-H.","year":"2005","journal-title":"J. Ind. Manage. Optim."},{"key":"CIT0006","unstructured":"C. Daskalakis, A. Ilyas, V. Syrgkanis, and H. Zeng,Training gans with optimism, Proceedings of the 6th International Conference on Learning Representations, Vancouver, BC, Canada, 2018."},{"key":"CIT0007","unstructured":"I. Gemp and S. Mahadevan,Global convergence to the equilibrium of gans using variational inequalities, preprint (2018). Available at arXiv:1808.01531."},{"key":"CIT0008","unstructured":"G. Gidel, H. Berard, P. Vincent, and S. Lacoste-Julien,A variational inequality perspective on generative adversarial nets, preprint (2018). Available at arXiv:1802.10551."},{"key":"CIT0009","unstructured":"G. Gidel, R.A. Hemmat, M. Pezeshki, G. Huang, R. Lepriol, S. Lacoste-Julien, and I. Mitliagkas,Negative momentum for improved game dynamics, preprint (2018). Available at arXiv:1807.04740."},{"key":"CIT0010","unstructured":"I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio,Generative adversarial nets, Advances in Neural Information Processing Systems 27, Palais des Congr\u00e8s de Montr\u00e9al, Montr\u00e9al, Canada, 2014, pp. 2672\u20132680."},{"key":"CIT0011","unstructured":"C. Jin, P. Netrapalli, and M.I. Jordan,Minmax optimization: Stable limit points of gradient descent ascent are locally optimal, preprint (2019). Available at arXiv:1902.00618."},{"key":"CIT0012","unstructured":"T. Karras, T. Aila, S. Laine, and J. Lehtinen,Progressive growing of gans for improved quality, stability, and variation, preprint (2017). Available at arXiv:1710.10196."},{"key":"CIT0013","unstructured":"T. Liang and J. Stokes,Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks, preprint (2018). Available at arXiv:1802.06132."},{"key":"CIT0014","unstructured":"P. Mertikopoulos, H. Zenati, B. Lecouat, C.S. Foo, V. Chandrasekhar, and G. Piliouras,Mirror descent in saddle-point problems: Going the extra (gradient) mile, preprint (2018). Available at arXiv:1807.02629."},{"key":"CIT0015","unstructured":"L. Mescheder, S. Nowozin, and A. Geiger,The numerics of gans, Advances in Neural Information Processing Systems 30, Long Beach Convention Center, Long Beach, 2017, pp. 1825\u20131835."},{"key":"CIT0016","unstructured":"A. Mokhtari, A. Ozdaglar, and S. Pattathil,A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach, preprint (2019). Available at arXiv:1901.08511."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"CIT0018","unstructured":"S. Nowozin, B. Cseke, and R. Tomioka,f-gan: Training generative neural samplers using variational divergence minimization, Advances in Neural Information Processing Systems 29, Centre Convencions Internacional Barcelona, Barcelona, Spain, 2016, pp. 271\u2013279."},{"key":"CIT0019","unstructured":"A. Radford, L. Metz, and S. Chintala,Unsupervised representation learning with deep convolutional generative adversarial networks, preprint (2015). Available at arXiv:1511.06434."},{"key":"CIT0020","unstructured":"S. Shalev-Shwartz,Online learning and online convex optimization, Foundations and Trends\u0151 in Machine Learning 4(2) (2012), pp. 107\u2013194."},{"key":"CIT0021","unstructured":"W. Shi, C. Ledig, Z. Wang, L. Theis, and F. Huszar,Super resolution using a generative adversarial network, March 15 2018, US Patent App. 15\/706,428."},{"issue":"2","key":"CIT0022","first-page":"26","volume":"4","author":"Tieleman T.","year":"2012","journal-title":"COURSERA"},{"issue":"2","key":"CIT0023","first-page":"149","volume":"24","author":"Yuan Y.","year":"2006","journal-title":"J. Comput. Math."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1754414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T12:54:42Z","timestamp":1666356882000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1754414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,16]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9,2]]}},"alternative-id":["10.1080\/10556788.2020.1754414"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1754414","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,16]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-05-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}