{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:02:14Z","timestamp":1773385334435,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"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":["Math. Program."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10107-025-02197-1","type":"journal-article","created":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T03:09:02Z","timestamp":1741144142000},"page":"591-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nonsmooth nonconvex\u2013nonconcave minimax optimization: Primal\u2013dual balancing and iteration complexity analysis"],"prefix":"10.1007","volume":"214","author":[{"given":"Jiajin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5484-1134","authenticated-orcid":false,"given":"Linglingzhi","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony Man-Cho","family":"So","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"2197_CR1","unstructured":"Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein generative adversarial networks. In: Proceedings of the 34th International Conference on Machine Learning (ICML 2017), pp. 214\u2013223. PMLR (2017)"},{"key":"2197_CR2","doi-asserted-by":"crossref","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","DOI":"10.1287\/moor.1100.0449"},{"key":"2197_CR3","doi-asserted-by":"crossref","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","DOI":"10.1007\/s10107-011-0484-9"},{"issue":"5","key":"2197_CR4","doi-asserted-by":"publisher","first-page":"2766","DOI":"10.1214\/11-AOS918","volume":"39","author":"J-Y Audibert","year":"2011","unstructured":"Audibert, J.-Y., Catoni, O.: Robust linear least squares regression. Ann. Stat. 39(5), 2766\u20132794 (2011)","journal-title":"Ann. Stat."},{"key":"2197_CR5","doi-asserted-by":"crossref","unstructured":"Barazandeh, B., Razaviyayn, M.: Solving non-convex non-differentiable min\u2013max games using proximal gradient method. In: Proceedings of the 2020 IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 3162\u20133166. IEEE (2020)","DOI":"10.1109\/ICASSP40776.2020.9054474"},{"issue":"3","key":"2197_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"issue":"3","key":"2197_CR7","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"2197_CR8","unstructured":"Blanchet, J., Glynn, P.W., Yan, J., Zhou, Z.: Multivariate distributionally robust convex regression under absolute error loss. In: Advances in Neural Information Processing Systems 32 (2019)"},{"issue":"3","key":"2197_CR9","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1017\/jpr.2019.49","volume":"56","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Kang, Y., Murthy, K.: Robust Wasserstein profile inference and applications to machine learning. J. Appl. Probab. 56(3), 830\u2013857 (2019)","journal-title":"J. Appl. Probab."},{"issue":"6","key":"2197_CR10","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Daniilidis, A., Ley, O., Mazet, L.: Characterizations of \u0141ojasiewicz inequalities and applications. Trans. Am. Math. Soc. 362(6), 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"2197_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-016-1091-6","volume":"165","author":"J Bolte","year":"2017","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Math. Program. 165(2), 471\u2013507 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"2197_CR12","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1137\/21M1465470","volume":"33","author":"RI Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: Alternating proximal-gradient steps for (stochastic) nonconvex\u2013concave minimax problems. SIAM J. Optim. 33(3), 1884\u20131913 (2023)","journal-title":"SIAM J. Optim."},{"key":"2197_CR13","doi-asserted-by":"crossref","unstructured":"Bubeck, S.: Convex optimization: Algorithms and complexity. Found. Trends\u00ae Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","DOI":"10.1561\/2200000050"},{"issue":"1","key":"2197_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-019-01406-y","volume":"184","author":"Y Carmon","year":"2020","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points I. Math. Program. 184(1), 71\u2013120 (2020)","journal-title":"Math. Program."},{"issue":"4","key":"2197_CR15","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)","journal-title":"SIAM J. Optim."},{"key":"2197_CR16","unstructured":"Chen, Z., Zhou, Y., Xu, T., Liang, Y.: Proximal gradient descent-ascent: Variable convergence under K\u0141 geometry. In: Proceedings of the 9th International Conference on Learning Representations (ICLR 2021) (2021)"},{"key":"2197_CR17","unstructured":"Collins, L., Mokhtari, A., Shakkottai, S.: Task-robust model-agnostic meta-learning. In: Advances in Neural Information Processing Systems 33 (2020)"},{"key":"2197_CR18","unstructured":"Cranko, Z., Shi, Z., Zhang, X., Nock, R., Kornblith, S.: Generalised Lipschitz regularisation equals distributional robustness. In: Proceedings of the 38th International Conference on Machine Learning (ICML 2021), pp. 2178\u20132188. PMLR (2021)"},{"key":"2197_CR19","doi-asserted-by":"crossref","unstructured":"Cui, Y., Pang, J.-S.: Modern Nonconvex Nondifferentiable Optimization. MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics and the Mathematical Optimization Society, Philadelphia, (2022)","DOI":"10.1137\/1.9781611976748"},{"key":"2197_CR20","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Skoulakis, S., Zampetakis, M.: The complexity of constrained min\u2013max optimization. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1466\u20131478 (2021)","DOI":"10.1145\/3406325.3451125"},{"issue":"1","key":"2197_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"key":"2197_CR22","doi-asserted-by":"crossref","unstructured":"Drusvyatskiy, D., Ioffe, A.D., Lewis, A.S.: Nonsmooth optimization using Taylor-like models: Error bounds, convergence, and termination criteria. Math. Program. 185(1), 357\u2013383 (2021)","DOI":"10.1007\/s10107-019-01432-w"},{"issue":"3","key":"2197_CR23","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919\u2013948 (2018)","journal-title":"Math. Oper. Res."},{"key":"2197_CR24","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2019)","journal-title":"Math. Program."},{"key":"2197_CR25","doi-asserted-by":"crossref","unstructured":"Frankel, P., Garrigos, G., Peypouquet, J.: Splitting methods with variable metric for Kurdyka\u2013\u0141ojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3), 874\u2013900 (2015)","DOI":"10.1007\/s10957-014-0642-3"},{"issue":"3","key":"2197_CR26","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1287\/opre.2022.2383","volume":"72","author":"R Gao","year":"2024","unstructured":"Gao, R., Chen, X., Kleywegt, A.J.: Wasserstein distributionally robust optimization and variation regularization. Oper. Res. 72(3), 1177\u20131191 (2024)","journal-title":"Oper. Res."},{"key":"2197_CR27","doi-asserted-by":"crossref","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial networks. Commun. ACM 63(11), 139\u2013144 (2020)","DOI":"10.1145\/3422622"},{"key":"2197_CR28","doi-asserted-by":"crossref","unstructured":"Hoffman, A. J.: On approximate solutions of systems of linear inequalities. J. Nat. Bur. Stan. 49(4), 263\u2013265 (1952)","DOI":"10.6028\/jres.049.027"},{"key":"2197_CR29","doi-asserted-by":"crossref","unstructured":"Hu, Y., Li, C., Wang, J., Yang, X., Zhu, L.: Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications. Appl. Math. Optim. 87(3), 52 (2023)","DOI":"10.1007\/s00245-022-09957-x"},{"key":"2197_CR30","doi-asserted-by":"crossref","unstructured":"Hu, Y., Li, C., Yang, X.: On convergence rates of linearized proximal algorithms for convex composite optimization with applications. SIAM J. Optim. 26(2), 1207\u20131235 (2016)","DOI":"10.1137\/140993090"},{"key":"2197_CR31","unstructured":"Hu, Z., Hong, L.J.: Kullback\u2013Leibler divergence constrained distributionally robust optimization. Available at Optimization Online (2013)"},{"key":"2197_CR32","unstructured":"Huang, F., Wu, X., Huang, H.: Efficient mirror descent ascent methods for nonsmooth minimax problems. In: Advances in Neural Information Processing Systems 34 (2021)"},{"key":"2197_CR33","unstructured":"Jin, C., Netrapalli, P., Jordan, M.: What is local optimality in nonconvex\u2013nonconcave minimax optimization? In: Proceedings of the 37th of International Conference on Machine Learning (ICML 2020), pp. 4880\u20134889. PMLR (2020)"},{"key":"2197_CR34","unstructured":"Levy, D., Carmon, Y., Duchi, J.C., Sidford, A.: Large-scale methods for distributionally robust optimization. In: Advances in Neural Information Processing Systems 33 (2020)"},{"key":"2197_CR35","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Program. 158, 501\u2013546 (2016)","journal-title":"Math. Program."},{"key":"2197_CR36","doi-asserted-by":"crossref","unstructured":"Li, G., Pong, T.K.: Calculus of the exponent of Kurdyka\u2013\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math. 18(5), 1199\u20131232 (2018)","DOI":"10.1007\/s10208-017-9366-8"},{"key":"2197_CR37","unstructured":"Li, H., Tian, Y., Zhang, J., Jadbabaie, A.: Complexity lower bounds for nonconvex\u2013strongly-concave min\u2013max optimization. In: Advances in Neural Information Processing Systems 34 (2021)"},{"key":"2197_CR38","doi-asserted-by":"crossref","unstructured":"Li, J., So, A.M.-C., Ma, W.-K.: Understanding notions of stationarity in nonsmooth optimization: A guided tour of various constructions of subdifferential for nonsmooth functions. IEEE Signal Process. Magazine 37(5), 18\u201331 (2020)","DOI":"10.1109\/MSP.2020.3003845"},{"key":"2197_CR39","unstructured":"Lin, T., Jin, C., Jordan, M.: Near-optimal algorithms for minimax optimization. In: Proceedings of the 33rd Annual Conference on Learning Theory (COLT 2020), pp. 2738\u20132779. PMLR (2020)"},{"key":"2197_CR40","unstructured":"Lin, T., Jin, C., Jordan, M.: On gradient descent ascent for nonconvex\u2013concave minimax problems. In: Proceedings of the 37th International Conference on Machine Learning (ICML 2020), pp. 6083\u20136093. PMLR (2020)"},{"key":"2197_CR41","unstructured":"Lin, T., Jin, C., Jordan, M.: Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization. arXiv preprint arXiv:2408.11974 (2024)"},{"key":"2197_CR42","doi-asserted-by":"crossref","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided non-convex min\u2013max problems: Algorithms and applications. IEEE Trans. Signal Process. 68, 3676\u20133691 (2020)","DOI":"10.1109\/TSP.2020.2986363"},{"key":"2197_CR43","doi-asserted-by":"crossref","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: A general approach. Ann. Oper. Res. 46(1), 157\u2013178 (1993)","DOI":"10.1007\/BF02096261"},{"key":"2197_CR44","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: Proceedings of the 6th International Conference on Learning Representations (ICLR 2018) (2018)"},{"key":"2197_CR45","unstructured":"Mohri, M., Sivek, G., Suresh, A.T.: Agnostic federated learning. In: Proceedings of the 36th International Conference on Machine Learning (ICML 2019), pp. 4615\u20134625. PMLR (2019)"},{"key":"2197_CR46","unstructured":"Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with $$f$$-divergences. In: Advances in Neural Information Processing Systems 29 (2016)"},{"issue":"3","key":"2197_CR47","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1080\/08927020600643812","volume":"22","author":"Yu Nesterov","year":"2007","unstructured":"Nesterov, Yu.: Modified Gauss\u2013Newton scheme with worst case guarantees for global performance. Optim. Methods Softw. 22(3), 469\u2013483 (2007)","journal-title":"Optim. Methods Softw."},{"key":"2197_CR48","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T., Lee, J.D., Razaviyayn, M.: Solving a class of non-convex min\u2013max games using iterative first order methods. In: Advances in Neural Information Processing Systems 32 (2019)"},{"key":"2197_CR49","doi-asserted-by":"crossref","unstructured":"Ostrovskii, D.M., Lowy, A., Razaviyayn, M.: Efficient search of first-order Nash equilibria in nonconvex\u2013concave smooth min\u2013max problems. SIAM J. Optim. 31(4), 2508\u20132538 (2021)","DOI":"10.1137\/20M1337600"},{"key":"2197_CR50","doi-asserted-by":"crossref","unstructured":"Pang, J.-S., Razaviyayn, M.: A unified distributed algorithm for non-cooperative games. In: Cui, S., Hero, A.O., III, Luo, Z.-Q., Moura, J.M.F (eds.) Big Data over Networks. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781316162750.005"},{"issue":"4","key":"2197_CR51","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2197_CR52","doi-asserted-by":"crossref","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Weakly-convex\u2013concave min\u2013max optimization: Provable algorithms and applications in machine learning. Optim. Methods Softw. 37(3), 1087\u20131121 (2022)","DOI":"10.1080\/10556788.2021.1895152"},{"key":"2197_CR53","first-page":"4","volume":"3","author":"H Rahimian","year":"2022","unstructured":"Rahimian, H., Mehrotra, S.: Frameworks and results in distributionally robust optimization. Open J. Math. Optim. 3, 4 (2022)","journal-title":"Open J. Math. Optim."},{"key":"2197_CR54","doi-asserted-by":"crossref","unstructured":"Razaviyayn, M., Huang, T., Lu, S., Nouiehed, M., Sanjabi, M., Hong, M.: Nonconvex min\u2013max optimization: Applications, challenges, and recent theoretical advances. IEEE Signal Process. Mag. 37(5), 55\u201366 (2020)","DOI":"10.1109\/MSP.2020.3003851"},{"key":"2197_CR55","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000)","DOI":"10.21314\/JOR.2000.038"},{"key":"2197_CR56","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, volume 37 of Grundlehren der mathematischen Wissenschaften, 2nd edn., Springer Science & Business Media (2009)"},{"key":"2197_CR57","unstructured":"Shafieezadeh-Abadeh, S., Kuhn, D., Mohajerin Esfahani, P.: Regularization via mass transportation. J. Mach. Learn. Res. 20(103), 1\u201368 (2019)"},{"key":"2197_CR58","unstructured":"Shalev-Shwartz, S., Wexler, Y.: Minimizing the maximal loss: How and why. In: Proceedings of the 33rd International Conference on Machine Learning (ICML 2016), pp. 793\u2013801. PMLR (2016)"},{"key":"2197_CR59","unstructured":"Sinha, A., Namkoong, H., Duchi, J.: Certifying some distributional robustness with principled adversarial training. In: Proceedings of the 6th International Conference on Learning Representations (ICLR 2018) (2018)"},{"issue":"1","key":"2197_CR60","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pac. J. Math. 8(1), 171\u2013176 (1958)","journal-title":"Pac. J. Math."},{"key":"2197_CR61","unstructured":"Thekumparampil, K.K., Jain, P., Netrapalli, P., Oh, S.: Efficient algorithms for smooth minimax optimization. In: Advances in Neural Information Processing Systems 32 (2019)"},{"key":"2197_CR62","doi-asserted-by":"crossref","unstructured":"Xu, Z., Zhang, H., Xu, Y., Lan, G.: A unified single-loop alternating gradient projection algorithm for nonconvex\u2013concave and convex\u2013nonconcave minimax problems. Math. Program. 201, 635\u2013706 (2023)","DOI":"10.1007\/s10107-022-01919-z"},{"key":"2197_CR63","unstructured":"Yang, J., Orvieto, A., Lucchi, A., He, N.: Faster single-loop algorithms for minimax optimization without strong concavity. In: Proceedings of the 25th International Conference on Artificial Intelligence and Statistics (AISTATS 2022), pp. 5485\u20135517. PMLR (2012)"},{"key":"2197_CR64","unstructured":"Yang, J., Zhang, S., Kiyavash, N., He, N.: A catalyst framework for minimax optimization. In: Advances in Neural Information Processing Systems 33 (2020)"},{"issue":"3","key":"2197_CR65","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Luo, Z.-Q.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020)","journal-title":"SIAM J. Optim."},{"key":"2197_CR66","unstructured":"Zhang, J., Xiao, P., Sun, R., Luo, Z.-Q.: A single-loop smoothed gradient descent-ascent algorithm for nonconvex\u2013concave min\u2013max problems. In: Advances in Neural Information Processing Systems 33 (2020)"},{"key":"2197_CR67","unstructured":"Zhang, L., Zhou, Z.-H.: $$\\ell _1$$-regression with heavy-tailed distributions. In: Advances in Neural Information Processing Systems 31 (2018)"},{"key":"2197_CR68","unstructured":"Zhang, S., Yang, J., Guzm\u00e1n, C., Kiyavash, N., He, N. The complexity of nonconvex\u2013strongly-concave minimax optimization. In: Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021), pp. 482\u2013492. PMLR (2021)"},{"issue":"2","key":"2197_CR69","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.M.-C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689\u2013728 (2017)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02197-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-025-02197-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02197-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T07:44:07Z","timestamp":1764575047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-025-02197-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,5]]},"references-count":69,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2197"],"URL":"https:\/\/doi.org\/10.1007\/s10107-025-02197-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,5]]},"assertion":[{"value":"27 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}