{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:51:33Z","timestamp":1759366293156,"version":"build-2065373602"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s12190-025-02563-4","type":"journal-article","created":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T16:15:24Z","timestamp":1750608924000},"page":"6701-6725","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerated stochastic alternating mirror descent ascent algorithm for nonconvex-strongly concave minimax problems"],"prefix":"10.1007","volume":"71","author":[{"given":"Lulu","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yue","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6586-2862","authenticated-orcid":false,"given":"Yong-Jin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"issue":"3","key":"2563_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"2563_CR2","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1137\/21M1465470","volume":"33","author":"R.I. Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: Alternating proximal-gradient steps for (stochastic) nonconvex-concave minimax problems. SIAM J. Optim. 33(3), 1884\u20131913 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2563_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00934676","volume":"34","author":"Y. Censor","year":"1981","unstructured":"Censor, Y., Lent, A.: An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 34(3), 321\u2013353 (1981)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2563_CR4","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y. Censor","year":"1992","unstructured":"Censor, Y., Zenios, S.A.: Proximal minimization algorithm with d-functions. J. Optim. Theory Appl. 73(3), 451\u2013464 (1992)","journal-title":"J Optim Theory Appl"},{"unstructured":"Chen, Z.Y., Zhou, Y., Xu, T.Y., Liang, Y.B.: Proximal gradient descent-ascent: variable convergence under K\u0141 geometry. ICLR. (2021)","key":"2563_CR5"},{"doi-asserted-by":"crossref","unstructured":"Chen, Z.Y., Ma, S.C., Zhou, Y.: Accelerated proximal alternating gradient-descent-ascent for nonconvex minimax machine learning. ISIT, 672\u2013677 (2022)","key":"2563_CR6","DOI":"10.1109\/ISIT50566.2022.9834691"},{"issue":"68","key":"2563_CR7","first-page":"1","volume":"20","author":"J. Duchi","year":"2019","unstructured":"Duchi, J., Namkoong, H.: Variance-based regularization with convex objectives. J. Mach. Learn. Res. 20(68), 1\u201355 (2019)","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Cutkosky, A., Orabona, F.: Momentum-based variance reduction in non-convex SGD. NeurIPS. (2019)","key":"2563_CR8"},{"unstructured":"Fang, C., Li, C.J., Lin, Z.C., Zhang, T.: Spider: near-optimal non-convex optimization via stochastic path-integrated differential estimator. NeurIPS. (2018)","key":"2563_CR9"},{"key":"2563_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S. Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.H., Zhang, H.C.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155, 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"2563_CR11","first-page":"1","volume":"23","author":"F.H. Huang","year":"2022","unstructured":"Huang, F.H., Gao, S.Q., Pei, J., Huang, H.: Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization. J. Mach. Learn. Res. 23, 1\u201370 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"2563_CR12","first-page":"9074","volume":"34","author":"F.H. Huang","year":"2021","unstructured":"Huang, F.H., Li, J.Y., Huang, H.: Super-adam: faster and universal framework of adaptive gradients. NeurIPS. 34, 9074\u20139085 (2021)","journal-title":"NeurIPS."},{"key":"2563_CR13","first-page":"10431","volume":"34","author":"F.H. Huang","year":"2021","unstructured":"Huang, F.H., Wu, X.D., Huang, H.: Efficient mirror descent ascent methods for nonsmooth minimax problems. NeurIPS. 34, 10431\u201310443 (2021)","journal-title":"NeurIPS."},{"key":"2563_CR14","first-page":"2365","volume":"206","author":"F.H. Huang","year":"2023","unstructured":"Huang, F.H., Wu, X.D., Hu, Z.M.: Adagda: faster adaptive gradient descent ascent methods for minimax optimization. PMLR. 206, 2365\u20132389 (2023)","journal-title":"PMLR."},{"unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. ICLR. (2015)","key":"2563_CR15"},{"key":"2563_CR16","first-page":"1895","volume":"70","author":"J.M. Kohler","year":"2017","unstructured":"Kohler, J.M., Lucchi, A.: Sub-sampled cubic regularization for non-convex optimization. PMLR. 70, 1895\u20131904 (2017)","journal-title":"PMLR."},{"key":"2563_CR17","first-page":"6083","volume":"119","author":"T.Y. Lin","year":"2020","unstructured":"Lin, T.Y., Jin, C.: On gradient descent ascent for nonconvex-concave minimax problems. ICML. 119, 6083\u20136093 (2020)","journal-title":"ICML."},{"key":"2563_CR18","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1109\/TSP.2020.2986363","volume":"68","author":"S.T. Lu","year":"2020","unstructured":"Lu, S.T., Tsaknakis, I., Hong, M.Y., Chen, Y.X.: Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications. IEEE. Trans. Signal. Process. 68, 3676\u20133691 (2020)","journal-title":"IEEE. Trans. Signal. Process."},{"key":"2563_CR19","first-page":"20566","volume":"33","author":"L. Luo","year":"2020","unstructured":"Luo, L., Ye, H.S., Huang, Z.C., Zhang, T.: Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems. NeurIPS. 33, 20566\u201320577 (2020)","journal-title":"NeurIPS."},{"unstructured":"Mohri, M., Sivek, G., Suresh, A.T.: Agnostic federated learning. PMLR, 4615\u20134625 (2019)","key":"2563_CR20"},{"unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$\\mathcal{O}(1\/k^2)$$. Dokl. Akad. Nauk SSSR. 269(3), 543\u2013547 (1983)","key":"2563_CR21"},{"key":"2563_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y. Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer (2018)"},{"key":"2563_CR23","first-page":"14934","volume":"32","author":"M. Nouiehed","year":"2019","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T.J., Lee, J.D., Meisam, R.: Solving a class of non-convex min-max games using iterative first order methods. NeurIPS. 32, 14934\u201314942 (2019)","journal-title":"NeurIPS."},{"issue":"5","key":"2563_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B.T. Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"doi-asserted-by":"crossref","unstructured":"Rafique, H., Liu, M.R., Lin, Q.H., Yang, T.B.: Weakly convex-concave min-max optimization: provable algorithms and applications in machine learning. Optim. Methods Softw. 1\u201335 (2021)","key":"2563_CR25","DOI":"10.1080\/10556788.2021.1895152"},{"unstructured":"Sharma, P., Panda, R., Joshi, G., Varshney, P.: Federated minimax optimization: Improved convergence analyses and algorithms. PMLR. 19683\u201319730 (2022)","key":"2563_CR26"},{"unstructured":"Wang, Y.H., Zhang, G.D., Ba, J.: On solving minimax optimization locally: a follow-the-ridge approach. ICLR. 1\u201318 (2019)","key":"2563_CR27"},{"key":"2563_CR28","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10898-022-01160-0","volume":"87","author":"Z.R. Wang","year":"2023","unstructured":"Wang, Z.R., Balasubramanian, K., Ma, S.Q., Razaviyayn, M.: Zeroth-order algorithms for nonconvex minimax problems with improved complexities. J. Glob. Optim. 87, 709\u2013740 (2023)","journal-title":"J. Glob. Optim."},{"key":"2563_CR29","first-page":"35201","volume":"35","author":"A. Wibisono","year":"2022","unstructured":"Wibisono, A., Tao, M.L., Piliouras, G.: Alternating mirror descent for constrained min-max games. NeurIPS. 35, 35201\u201335212 (2022)","journal-title":"NeurIPS."},{"unstructured":"Xian, W.H., Huang, F.H., Zhang, Y.F., Huang, H.: A faster decentralized algorithm for nonconvex minimax problems. NeurIPS. 25865\u201325877 (2021)","key":"2563_CR30"},{"unstructured":"Xu, T.Y., Wang, Z., Liang, Y.B., Poor, H.V.: Enhanced first and zeroth order variance reduced algorithms for min-max optimization. arXiv:2006.09361. (2020)","key":"2563_CR31"},{"unstructured":"Xu, Y., Wang, J., Xu, Z.: A mirror descent gradient ascent algorithm for one side relatively smooth nonconvex-concave minimax optimization problems. Oper. Res. Trans. 28(1), 18\u201328 (2024)","key":"2563_CR32"},{"doi-asserted-by":"crossref","unstructured":"Xu, Z., Zhang, H.L., Xu, Y., Lan, G.H.: A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems. Math. Program. 1\u201372 (2023)","key":"2563_CR33","DOI":"10.1007\/s10107-022-01919-z"},{"unstructured":"Yan, Y., Xu, Y., Lin, Q.H., Zhang, L.J., Yang, T.B.: Stochastic primal-dual algorithms with faster convergence than O(1\/T) for problems without bilinear structure. arXiv:1904.10112. (2019)","key":"2563_CR34"},{"key":"2563_CR35","first-page":"21668","volume":"35","author":"X. Zhang","year":"2022","unstructured":"Zhang, X., Aybat, N.S., G\u00fcrb\u00fczbalaban, M.: Sapd+: an accelerated stochastic method for nonconvex-concave minimax problems. NeurIPS. 35, 21668\u201321681 (2022)","journal-title":"NeurIPS."},{"unstructured":"Zhang, S.Q., He, N.: On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization. arXiv:1806.04781. (2018)","key":"2563_CR36"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02563-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02563-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02563-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:10:58Z","timestamp":1759331458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02563-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2563"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02563-4","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2025,6,22]]},"assertion":[{"value":"7 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}