{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T19:44:47Z","timestamp":1786045487547,"version":"3.56.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100018919","name":"Peng Cheng Laboratory","doi-asserted-by":"publisher","award":["PCL2022A05"],"award-info":[{"award-number":["PCL2022A05"]}],"id":[{"id":"10.13039\/100018919","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11871453"],"award-info":[{"award-number":["11871453"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11731013"],"award-info":[{"award-number":["11731013"]}],"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":[[2022,9]]},"DOI":"10.1007\/s10589-022-00384-w","type":"journal-article","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T12:03:30Z","timestamp":1656072210000},"page":"143-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A stochastic primal-dual method for a class of nonconvex constrained optimization"],"prefix":"10.1007","volume":"83","author":[{"given":"Lingzi","family":"Jin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3492-9235","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"384_CR1","doi-asserted-by":"crossref","unstructured":"Boob, D., Deng, Q., Lan, G.: Stochastic first-order methods for convex and nonconvex functional constrained optimization. Math. Program. (2022)","DOI":"10.1007\/s10107-021-01742-y"},{"issue":"2","key":"384_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10957-010-9754-6","volume":"148","author":"MC Campi","year":"2011","unstructured":"Campi, M.C., Garatti, S.: A sampling-and-discarding approach to chance-constrained optimization: Feasibility and optimality. J. Optim. Theory App. 148(2), 257\u2013280 (2011)","journal-title":"J. Optim. Theory App."},{"key":"384_CR3","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In: 28th NIPS, vol. 27 (2014)"},{"issue":"1\u20132","key":"384_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10107-017-1225-5","volume":"173","author":"S Ghadimi","year":"2019","unstructured":"Ghadimi, S.: Conditional gradient type methods for composite nonlinear and stochastic optimization. Math. Program. 173(1\u20132), 431\u2013464 (2019)","journal-title":"Math. Program."},{"issue":"4","key":"384_CR5","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."},{"issue":"2","key":"384_CR6","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1137\/18M1213488","volume":"31","author":"EY Hamedani","year":"2021","unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm with line search for general convex-concave saddle point problems. SIAM J. Optim. 31(2), 1299\u20131329 (2021)","journal-title":"SIAM J. Optim."},{"key":"384_CR7","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer (2001)","DOI":"10.1007\/978-3-642-56468-0"},{"key":"384_CR8","doi-asserted-by":"crossref","unstructured":"Huo, Z., Gu, B., Liu, J., Huang, H.: Accelerated method for stochastic composition optimization with nonsmooth regularization. In: 32nd AAAI Conference on Artificial Intelligence, pp. 3287\u20133294. AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11795"},{"issue":"3","key":"384_CR9","first-page":"315","volume":"1","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. NIPS 1(3), 315\u2013323 (2013)","journal-title":"NIPS"},{"key":"384_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-Order and Stochastic Optimization Methods for Machine Learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-Order and Stochastic Optimization Methods for Machine Learning. Springer, Cham (2020)"},{"issue":"3","key":"384_CR11","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1137\/20M1352788","volume":"31","author":"G Lan","year":"2021","unstructured":"Lan, G., Romeijn, E., Zhou, Z.: Conditional gradient methods for convex optimization with general affine and nonlinear constraints. SIAM J. Optim. 31(3), 2307\u20132339 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"384_CR12","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10589-020-00179-x","volume":"76","author":"G Lan","year":"2020","unstructured":"Lan, G., Zhou, Z.: Algorithms for stochastic optimization with function or expectation constraints. Comput. Optim. App. 76(2), 461\u2013498 (2020)","journal-title":"Comput. Optim. App."},{"key":"384_CR13","unstructured":"Li, Z., Chen, P.-Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented lagrangian method for constrained nonconvex optimization. In: 24th AISTATS, vol. 130, pp. 2170\u20132178 (2021)"},{"issue":"4","key":"384_CR14","first-page":"373","volume":"3","author":"Z Li","year":"2021","unstructured":"Li, Z., Xu, Y.: Augmented lagrangian based first-order methods for convex-constrained programs with weakly-convex objective. INFROMS J. Optim. 3(4), 373\u2013397 (2021)","journal-title":"INFROMS J. Optim."},{"issue":"1","key":"384_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10589-022-00358-y","volume":"82","author":"Q Lin","year":"2022","unstructured":"Lin, Q., Ma, R., Xu, Y.: Complexity of an inexact proximal-point penalty methods for constrained non-convex optimization. Comput. Optim. Appl. 82(1), 175\u2013224 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"384_CR16","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1137\/17M1152334","volume":"28","author":"Q Lin","year":"2018","unstructured":"Lin, Q., Nadarajah, S., Soheili, N.: A level-set method for convex optimization with a feasible solution path. SIAM J. Optim. 28(4), 3290\u20133311 (2018)","journal-title":"SIAM J. Optim."},{"key":"384_CR17","unstructured":"Lin, T., Jin, C., Jordan, M.I.: On gradient descent ascent for nonconvex-concave minimax problems. In: 37th ICML, vol. 119, pp. 6083\u20136093 (2020)"},{"key":"384_CR18","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1109\/TSP.2020.2986363","volume":"68","author":"S Lu","year":"2020","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided non-convex min-max problems: algorithms and applications. IEEE T. Signal Proces. 68, 3676\u20133691 (2020)","journal-title":"IEEE T. Signal Proces."},{"issue":"4","key":"384_CR19","doi-asserted-by":"publisher","first-page":"2916","DOI":"10.1137\/18M1181249","volume":"29","author":"A Milzarek","year":"2019","unstructured":"Milzarek, A., Xiao, X., Cen, S., Wen, Z., Ulbrich, M.: A stochastic semismooth newton method for nonsmooth nonconvex optimization. SIAM J. Optim. 29(4), 2916\u20132948 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"384_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: 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 (2004)","journal-title":"SIAM J. Optim."},{"key":"384_CR21","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1c\u0306, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: 34th ICML, vol.\u00a070, pp. 2613\u20132621 (2017)"},{"key":"384_CR22","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"key":"384_CR23","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: 33th NIPS, vol.\u00a032 (2019)"},{"issue":"1","key":"384_CR24","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10589-020-00237-4","volume":"78","author":"W Pan","year":"2021","unstructured":"Pan, W., Shen, J., Xu, Z.: An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem. Comput. Optim. Appl. 78(1), 287\u2013306 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"110","key":"384_CR25","first-page":"1","volume":"21","author":"NH Pham","year":"2020","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Quoc, T.-D.: ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization. J. Mach. Lean. Res. 21(110), 1\u201348 (2020)","journal-title":"J. Mach. Lean. Res."},{"issue":"1","key":"384_CR26","first-page":"33","volume":"174","author":"BT Poljak","year":"1967","unstructured":"Poljak, B.T.: A general method for solving extremal problems. Dokl. Akad. Nauk SSSR 174(1), 33\u201336 (1967)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"384_CR27","doi-asserted-by":"crossref","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Weakly-convex concave min-max optimization: provable algorithms and applications in machine learning. Optim. Method Softw. pp. 1\u201335 (2021)","DOI":"10.1080\/10556788.2021.1895152"},{"key":"384_CR28","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Sra, S., Poczos, B., Smola, A.: Stochastic Frank-Wolfe Methods for Nonconvex Optimization. In: 54TH ALLERTON, pp. 1244\u20131251 (2016)","DOI":"10.1109\/ALLERTON.2016.7852377"},{"issue":"3","key":"384_CR29","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Statist. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Statist."},{"key":"384_CR30","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1972)"},{"issue":"2","key":"384_CR31","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/1035044","volume":"35","author":"RT Rockafellar","year":"1993","unstructured":"Rockafellar, R.T.: Lagrange multipliers and optimality. SIAM Rev. 35(2), 183\u2013238 (1993)","journal-title":"SIAM Rev."},{"key":"384_CR32","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer Science & Business Media (2009)"},{"key":"384_CR33","unstructured":"Sahin, M. F., Eftekhari, A., Alacaoglu, A., Latorre, F., Cevher, V.: An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints. In: 33th NIPS, vol.\u00a032 (2019)"},{"issue":"2","key":"384_CR34","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/s10957-012-0230-3","volume":"158","author":"R Seri","year":"2013","unstructured":"Seri, R., Choirat, C.: Scenario approximation of robust and chance-constrained programs. J. Optim. Theory App. 158(2), 590\u2013614 (2013)","journal-title":"J. Optim. Theory App."},{"issue":"3","key":"384_CR35","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":"5","key":"384_CR36","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1080\/10556788.2018.1471141","volume":"34","author":"X Wang","year":"2019","unstructured":"Wang, X., Wang, X., Yuan, Y.X.: Stochastic proximal quasi-newton methods for non-convex composite optimization. Optim. Method Softw. 34(5), 922\u2013948 (2019)","journal-title":"Optim. Method Softw."},{"issue":"3","key":"384_CR37","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/10556788.2014.940947","volume":"30","author":"X Wang","year":"2015","unstructured":"Wang, X., Yuan, Y.: An augmented lagrangian trust region method for equality constrained optimization. Optim. Method Softw. 30(3), 559\u2013582 (2015)","journal-title":"Optim. Method Softw."},{"issue":"5","key":"384_CR38","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1080\/10556788.2015.1004332","volume":"30","author":"X Wang","year":"2015","unstructured":"Wang, X., Zhang, H.: An augmented lagrangian affine scaling method for nonlinear programming. Optim. Methods Softw. 30(5), 934\u2013964 (2015)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"384_CR39","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"384_CR40","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1137\/18M1229869","volume":"30","author":"Y Xu","year":"2020","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"384_CR41","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/ijoo.2019.0033","volume":"3","author":"Y Xu","year":"2021","unstructured":"Xu, Y.: First-order methods for constrained convex programming based on linearized augmented lagrangian function. INFORMS J. Optim. 3(1), 89\u2013117 (2021)","journal-title":"INFORMS J. Optim."},{"key":"384_CR42","unstructured":"Xu, Z., Zhang, H., Xu, Y., Lan, G.: A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems (2020). arXiv preprint arXiv:2006.02032"},{"key":"384_CR43","unstructured":"Zhang, J., Xiao, P., Sun, R., Luo, Z.: A single-loop smoothed gradient descent-ascent algorithm for nonconvex-concave min-max problems. In: 34th NIPS, vol.\u00a033 (2020)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00384-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00384-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00384-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T06:16:14Z","timestamp":1659680174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00384-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,24]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["384"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00384-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,24]]},"assertion":[{"value":"6 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}