{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:22:33Z","timestamp":1773894153888,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["20ZR1420600"],"award-info":[{"award-number":["20ZR1420600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771208"],"award-info":[{"award-number":["11771208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10589-020-00237-4","type":"journal-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T17:04:59Z","timestamp":1604941499000},"page":"287-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem"],"prefix":"10.1007","volume":"78","author":[{"given":"Weiwei","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0968-8027","authenticated-orcid":false,"given":"Zi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"key":"237_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge University Press, Cambridge (2006)"},{"key":"237_CR2","unstructured":"Chen, Y., Ye, X.: Projection onto a simplex. arXiv preprint arXiv:1101.6081, (2011)"},{"key":"237_CR3","unstructured":"Dai, B., Shaw, A., Li, L., Xiao, L., He, N., Liu, Z., Chen, J., Sbeed, L. S.: Convergent reinforcement learning with nonlinear function approximation. arXiv preprint arXiv:1712.10285, (2017)"},{"key":"237_CR4","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V., Zeng, H.: Training gans with optimism. arXiv preprint arXiv:1711.00141, (2017)"},{"key":"237_CR5","unstructured":"Daskalakis, C., Panageas, I.: The limit points of (optimistic) gradient descent in min-max optimization. In Advances in neural information processing systems, pp. 9236\u20139246, (2018)"},{"issue":"2","key":"237_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"237_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1080\/05695558008974513","volume":"12","author":"Z Drezner","year":"1980","unstructured":"Drezner, Z., Wesolowsky, G.O.: A maximin location problem with maximum distance constraints. AIIE Trans. 12(3), 249\u2013252 (1980)","journal-title":"AIIE Trans."},{"key":"237_CR8","volume-title":"Finite-dimensional variational inequalities and complementarity problems","author":"F Facchinei","year":"2007","unstructured":"Facchinei, F., Pang, J.-S.: Finite-dimensional variational inequalities and complementarity problems. Springer, Berlin (2007)"},{"key":"237_CR9","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In Advances in neural information processing systems, pp. 2672\u20132680, (2014)"},{"issue":"4","key":"237_CR10","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1137\/120888880","volume":"23","author":"S Haines","year":"2013","unstructured":"Haines, S., Loeppky, J., Tseng, P., Wang, X.: Convex relaxations of the weighted maxmin dispersion problem. SIAM J. Optim. 23(4), 2264\u20132294 (2013)","journal-title":"SIAM J. Optim."},{"key":"237_CR11","unstructured":"Hamedani, E. Y., Jalilzadeh, A., Aybat, N.S., Shanbhag, U.V.: Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems. arXiv preprint arXiv:1806.04118, (2018)"},{"issue":"2","key":"237_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0378-3758(90)90122-B","volume":"26","author":"ME Johnson","year":"1990","unstructured":"Johnson, M.E., Moore, L.M., Ylvisaker, D.: Minimax and maximin distance designs. J. Stat. Plan. Inference 26(2), 131\u2013148 (1990)","journal-title":"J. Stat. Plan. Inference"},{"key":"237_CR13","doi-asserted-by":"crossref","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications. arXiv preprint arXiv:1902.08294, (2019)","DOI":"10.1109\/TSP.2020.2986363"},{"key":"237_CR14","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083, (2017)"},{"issue":"6","key":"237_CR15","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"key":"237_CR16","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T., Lee, J.D., Razaviyayn, M.: Solving a class of non-convex min-max games using iterative first order methods. In Advances in Neural Information Processing Systems, pp. 14905\u201314916, (2019)"},{"key":"237_CR17","doi-asserted-by":"crossref","unstructured":"Qian, Qi, Zhu, Shenghuo, Tang, Jiasheng, Jin, Rong, Sun, Baigui, Li, Hao: Robust optimization over multiple domains. Proceedings of the AAAI Conference on Artificial Intelligence Vol 33, pp 4739\u20134746 (2019)","DOI":"10.1609\/aaai.v33i01.33014739"},{"key":"237_CR18","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Non-convex min-max optimization: Provable algorithms and applications in machine learning. arXiv preprint arXiv:1810.02060, (2018)"},{"key":"237_CR19","unstructured":"Sanjabi, M., Ba, J., Razaviyayn, M., Lee, J.D.: On the convergence and robustness of training gans with regularized optimal transport. In Advances in Neural Information Processing Systems, pp. 7091\u20137101, (2018)"},{"key":"237_CR20","first-page":"491","volume":"6","author":"R Schaback","year":"1995","unstructured":"Schaback, R.: Multivariate interpolation and approximation by translates of a basis function. Ser. Approx. Decompos. 6, 491\u2013514 (1995)","journal-title":"Ser. Approx. Decompos."},{"key":"237_CR21","first-page":"1050","volume":"29","author":"A Sinha","year":"2017","unstructured":"Sinha, A., Namkoong, H., Duchi, J.: Certifiable distributional robustness with principled adversarial training. Statistics 29, 1050 (2017)","journal-title":"Statistics"},{"issue":"3","key":"237_CR22","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1137\/15M1047167","volume":"26","author":"S Wang","year":"2016","unstructured":"Wang, S., Xia, Y.: On the ball-constrained weighted maximin dispersion problem. SIAM J. Optim. 26(3), 1565\u20131588 (2016)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"237_CR23","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1093\/imaman\/7.3.219","volume":"7","author":"DJ White","year":"1996","unstructured":"White, D.J.: A heuristic approach to a weighted maxmin dispersion problem. IMA J. Manag. Math. 7(3), 219\u2013231 (1996)","journal-title":"IMA J. Manag. Math."},{"issue":"4","key":"237_CR24","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s11590-017-1177-y","volume":"12","author":"Z Wu","year":"2018","unstructured":"Wu, Z., Xia, Y., Wang, S.: Approximating the weighted maximin dispersion problem over an $$\\ell _p$$-ball: SDP relaxation is misleading. Optim. Lett. 12(4), 875\u2013883 (2018)","journal-title":"Optim. Lett."},{"issue":"Jul","key":"237_CR25","first-page":"1485","volume":"10","author":"H Xu","year":"2009","unstructured":"Xu, H., Caramanis, C., Mannor, S.: Robustness and regularization of support vector machines. J. Mach. Learn. Res. 10(Jul), 1485\u20131510 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"237_CR26","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2020007","author":"Z Xu","year":"2020","unstructured":"Xu, Z., Wang, S., Huang, J.: An efficient low complexity algorithm for box-constrained weighted maximin disperision problem. J. Ind. Manag. Optim. (2020). https:\/\/doi.org\/10.3934\/jimo.2020007","journal-title":"J. Ind. Manag. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00237-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00237-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00237-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,11]],"date-time":"2021-01-11T13:44:37Z","timestamp":1610372677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00237-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["237"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00237-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"14 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}