{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:17Z","timestamp":1740108257937,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS- 1715753"],"award-info":[{"award-number":["DMS- 1715753"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2355"],"award-info":[{"award-number":["N00014-15-1-2355"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00186-022-00805-w","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T10:04:06Z","timestamp":1668679446000},"page":"57-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An implicit gradient-descent procedure for minimax problems"],"prefix":"10.1007","volume":"97","author":[{"given":"Montacer","family":"Essid","sequence":"first","affiliation":[]},{"given":"Esteban G.","family":"Tabak","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6368-6252","authenticated-orcid":false,"given":"Giulio","family":"Trigila","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"805_CR1","unstructured":"Adolphs L, Daneshmand H, Lucchi A, Hofmann T (2019) Local saddle point optimization: a curvature exploitation approach. In: The 22nd International Conference on Artificial Intelligence and Statistics, 486\u2013495 PMLR"},{"issue":"2","key":"805_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s11831-019-09388-y","volume":"28","author":"H Alqahtani","year":"2021","unstructured":"Alqahtani H, Kavakli-Thorne M, Kumar G (2021) Applications of generative adversarial networks (gans): an updated review. Arch Comput Methods Eng 28(2):525\u2013552","journal-title":"Arch Comput Methods Eng"},{"issue":"3","key":"805_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.aml.2011.08.015","volume":"25","author":"P Angot","year":"2012","unstructured":"Angot P, Caltagirone J-P, Fabrie P (2012) A new fast method to compute saddle-points in constrained optimization and applications. Appl Math Lett 25(3):245\u2013251","journal-title":"Appl Math Lett"},{"key":"805_CR4","doi-asserted-by":"publisher","first-page":"106113","DOI":"10.1016\/j.cmpb.2021.106113","volume":"206","author":"B Barile","year":"2021","unstructured":"Barile B, Marzullo A, Stamile C, Durand-Dubief F, Sappey-Marinier D (2021) Data augmentation using generative adversarial neural networks on brain structural connectivity in multiple sclerosis. Comput Methods Programs Biomed 206:106113","journal-title":"Comput Methods Programs Biomed"},{"key":"805_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492904000212","volume":"14","author":"M Benzi","year":"2005","unstructured":"Benzi M, Golub GH, Liesen J (2005) Numerical solution of saddle point problems. Acta Numer 14:1\u2013137","journal-title":"Acta Numer"},{"issue":"6","key":"805_CR6","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1051\/m2an\/2015033","volume":"49","author":"G Carlier","year":"2015","unstructured":"Carlier G, Oberman A, Oudet E (2015) Numerical methods for matching for teams and wasserstein barycenters. ESAIM Math Model Numer Anal 49(6):1621\u20131642","journal-title":"ESAIM Math Model Numer Anal"},{"key":"805_CR7","doi-asserted-by":"crossref","unstructured":"Dan Y, Zhao Y, Li X, Li S, Hu M, Hu J (2020) Generative adversarial networks (gan) based efficient sampling of chemical composition space for inverse design of inorganic materials. npj Comput Mater 6(1), 1\u20137","DOI":"10.1038\/s41524-020-00352-0"},{"key":"805_CR8","unstructured":"Du SS, Hu W (2019) Linear convergence of the primal-dual gradient method for convex-concave saddle point problems without strong convexity. In: The 22nd International Conference on Artificial Intelligence and Statistics, 196\u2013205 PMLR"},{"issue":"4","key":"805_CR9","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1093\/imaiai\/iaz008","volume":"8","author":"M Essid","year":"2019","unstructured":"Essid M, Laefer DF, Tabak EG (2019) Adaptive optimal transport. Inform Inference J IMA 8(4):789\u2013816","journal-title":"Inform Inference J IMA"},{"key":"805_CR10","unstructured":"Essid M, Tabak E, Trigila G (2019) An implicit gradient-descent procedure for minimax problems. arXiv preprint arXiv:1906.00233"},{"key":"805_CR11","volume-title":"Optimal transport methods in economics","author":"A Galichon","year":"2018","unstructured":"Galichon A (2018) Optimal transport methods in economics. Princeton University Press, Princeton"},{"issue":"5","key":"805_CR12","doi-asserted-by":"publisher","first-page":"2812","DOI":"10.1137\/110854084","volume":"34","author":"A-L Gerner","year":"2012","unstructured":"Gerner A-L, Veroy K (2012) Certified reduced basis methods for parametrized saddle point problems. SIAM J Sci Comput 34(5):2812\u20132836","journal-title":"SIAM J Sci Comput"},{"key":"805_CR13","unstructured":"Goodfellow I, Pouget-Abadie J, Mirza M, Xu B, Warde-Farley D, Ozair S, Courville A, Bengio Y (2014) Generative adversarial nets. Adv Neural Inform Process Syst 2672\u20132680"},{"key":"805_CR14","doi-asserted-by":"crossref","unstructured":"Holding T, Lestas I (2014) On the convergence to saddle points of concave-convex functions, the gradient method and emergence of oscillations. In: 53rd IEEE Conference on Decision and Control, 1143\u20131148 IEEE","DOI":"10.1109\/CDC.2014.7039535"},{"key":"805_CR15","first-page":"199","volume":"7","author":"LV Kantorovich","year":"1942","unstructured":"Kantorovich LV (1942) On the translocation of masses. Compt Rend Akad Sei 7:199\u2013201","journal-title":"Compt Rend Akad Sei"},{"issue":"10","key":"805_CR16","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1101\/gr.268581.120","volume":"31","author":"JC Kimmel","year":"2021","unstructured":"Kimmel JC, Kelley DR (2021) Semisupervised adversarial neural networks for single-cell classification. Genome Res 31(10):1781\u20131793","journal-title":"Genome Res"},{"issue":"11","key":"805_CR17","doi-asserted-by":"publisher","first-page":"3964","DOI":"10.1109\/TPAMI.2020.2992934","volume":"43","author":"I Kobyzev","year":"2020","unstructured":"Kobyzev I, Prince SJ, Brubaker MA (2020) Normalizing flows: an introduction and review of current methods. IEEE Trans Pattern Anal Mach Intell 43(11):3964\u20133979","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"805_CR18","doi-asserted-by":"crossref","unstructured":"Kose T (1956) Solutions of saddle value problems by differential equations. Econometrica J Econ Soc 59\u201370","DOI":"10.2307\/1905259"},{"key":"805_CR19","unstructured":"Mazumdar EV, Jordan MI, Sastry SS (2019) On finding local nash equilibria (and only local nash equilibria) in zero-sum games. arXiv preprint arXiv:1901.00838"},{"key":"805_CR20","unstructured":"Mertikopoulos P, Zenati H, Lecouat B, Foo C-S, Chandrasekhar V, Piliouras G (2018) Mirror descent in saddle-point problems: going the extra (gradient) mile. arXiv preprint arXiv:1807.02629"},{"key":"805_CR21","unstructured":"Mokhtari A, Ozdaglar A, Jadbabaie A (2018) Escaping saddle points in constrained optimization. Adv Neural Inform Process Syst 31"},{"key":"805_CR22","unstructured":"Monge G (1781) M\u00e9moire sur la Th\u00e9orie des D\u00e9blais Et des remblais. De l\u2019Imprimerie Royale (1781)"},{"key":"805_CR23","volume-title":"Theory of games and economic behavior","author":"O Morgenstern","year":"1953","unstructured":"Morgenstern O, Von Neumann J (1953) Theory of games and economic behavior. Princeton University Press, Princeton"},{"issue":"1","key":"805_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski A (2004) Prox-method with rate of convergence o (1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J Optim 15(1):229\u2013251","journal-title":"SIAM J Optim"},{"issue":"151","key":"805_CR25","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal J (1980) Updating quasi-newton matrices with limited storage. Math Comput 35(151):773\u2013782","journal-title":"Math Comput"},{"key":"805_CR26","unstructured":"Palaniappan B, Bach F (2016) Stochastic variance reduction methods for saddle-point problems. Adv Neural Inform Process Syst 29"},{"key":"805_CR27","unstructured":"Pfau D, Vinyals O (2016) Connecting generative adversarial networks and actor-critic methods. arXiv preprint arXiv:1610.01945"},{"key":"805_CR28","doi-asserted-by":"crossref","unstructured":"Rafique H, Liu M, Lin Q, Yang T (2021) Weakly-convex\u2013concave min\u2013max optimization: provable algorithms and applications in machine learning. Optim Methods Softw 1\u201335","DOI":"10.1080\/10556788.2021.1895152"},{"key":"805_CR29","doi-asserted-by":"crossref","unstructured":"Santambrogio F (2015) Optimal transport for applied mathematicians. Birk\u00e4user, NY 55(58\u201363):94","DOI":"10.1007\/978-3-319-20828-2"},{"issue":"3","key":"805_CR30","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1137\/060660977","volume":"29","author":"J Sch\u00f6berl","year":"2007","unstructured":"Sch\u00f6berl J, Zulehner W (2007) Symmetric indefinite preconditioners for saddle point problems with applications to pde-constrained optimization problems. SIAM J Matrix Anal Appl 29(3):752\u2013773","journal-title":"SIAM J Matrix Anal Appl"},{"key":"805_CR31","unstructured":"Shafieezadeh Abadeh S, Mohajerin Esfahani PM, Kuhn D (2015) Distributionally robust logistic regression. Adv Neural Inform Process Syst 28"},{"key":"805_CR32","unstructured":"Sinha A, Namkoong H, Volpi R, Duchi J (2018) Certifying some distributional robustness with principled adversarial training. ICLR"},{"key":"805_CR33","doi-asserted-by":"crossref","unstructured":"Tabak EG, Trigila G, Zhao W (2022) Distributional barycenter problem through data-driven flows Pattern Recognit 108795","DOI":"10.1016\/j.patcog.2022.108795"},{"key":"805_CR34","unstructured":"Tabak EG, Turner CV (2013) A family of non-parametric density estimation algorithms. CPAM LXVI"},{"issue":"4","key":"805_CR35","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10994-019-05866-3","volume":"109","author":"EG Tabak","year":"2020","unstructured":"Tabak EG, Trigila G, Zhao W (2020) Conditional density estimation and simulation through optimal transport. Mach Learn 109(4):665\u2013688","journal-title":"Mach Learn"},{"issue":"4","key":"805_CR36","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1002\/cpa.21588","volume":"69","author":"G Trigila","year":"2016","unstructured":"Trigila G, Tabak EG (2016) Data-driven optimal transport. Commun Pure Appl Math 69(4):613\u2013648","journal-title":"Commun Pure Appl Math"},{"key":"805_CR37","first-page":"154","volume":"6","author":"H Uzawa","year":"1958","unstructured":"Uzawa H (1958) Iterative methods for concave programming. Stud Linear Nonlinear Program 6:154\u2013165","journal-title":"Stud Linear Nonlinear Program"},{"issue":"3","key":"805_CR38","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/17460441.2022.2019704","volume":"17","author":"M Vogt","year":"2022","unstructured":"Vogt M (2022) Using deep neural networks to explore chemical space. Expert Opin Drug Discov 17(3):297\u2013304","journal-title":"Expert Opin Drug Discov"},{"key":"805_CR39","doi-asserted-by":"crossref","unstructured":"Von Neumann J (1928) Zur Theorie der Gesellschaftsspiele, in Mathematische Annalen, 100. Julius Springer, Berlin","DOI":"10.1007\/BF01448847"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00805-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-022-00805-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-022-00805-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T12:04:11Z","timestamp":1675685051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-022-00805-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["805"],"URL":"https:\/\/doi.org\/10.1007\/s00186-022-00805-w","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"11 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}