{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T07:48:09Z","timestamp":1778917689202,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T00:00:00Z","timestamp":1694044800000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10589-023-00521-z","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T19:01:48Z","timestamp":1694113308000},"page":"117-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization"],"prefix":"10.1007","volume":"87","author":[{"given":"Zichong","family":"Li","sequence":"first","affiliation":[]},{"given":"Pin-Yu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Sijia","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Songtao","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4163-3723","authenticated-orcid":false,"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"521_CR1","doi-asserted-by":"crossref","unstructured":"Arjevani, Y., Carmon, Y., Duchi, J.C., Foster, D.J., Srebro, N., Woodworth, B.: Lower bounds for non-convex stochastic optimization. Math. Program. 199, 165\u2013214 (2023)","DOI":"10.1007\/s10107-022-01822-7"},{"key":"521_CR2","doi-asserted-by":"crossref","unstructured":"Boob, D., Deng, Q., Lan, G.: Stochastic first-order methods for convex and nonconvex functional constrained optimization. Math. Program. 197, 215\u2013279 (2023)","DOI":"10.1007\/s10107-021-01742-y"},{"issue":"4","key":"521_CR3","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., 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."},{"issue":"3","key":"521_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: Libsvm: a library for support vector machines. ACM Transa. Intell. Syst. Technol. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Transa. Intell. Syst. Technol. (TIST)"},{"key":"521_CR5","unstructured":"Cutkosky, A., Orabona, F.: Momentum-based variance reduction in non-convex sgd. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"521_CR6","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"521_CR7","unstructured":"Fang, C., Li, C.J., Lin, Z., Zhang, T.: Spider: near-optimal non-convex optimization via stochastic path-integrated differential estimator. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"521_CR8","unstructured":"Guyon, I., Gunn, S., Ben-Hur, A., Dror, G.: Result analysis of the nips 2003 feature selection challenge. In: Advances in neural information processing systems, vol. 17 (2004)"},{"issue":"5","key":"521_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4(5), 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"521_CR10","first-page":"1","volume":"23","author":"F Huang","year":"2022","unstructured":"Huang, F., Gao, S., Pei, J., Huang, H.: Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization. J. Mach. Learn. Res. 23, 1\u201336 (2022)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"521_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10589-022-00384-w","volume":"83","author":"L Jin","year":"2022","unstructured":"Jin, L., Wang, X.: A stochastic primal-dual method for a class of nonconvex constrained optimization. Comput. Optim. Appl. 83(1), 143\u2013180 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"521_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10107-015-0861-x","volume":"155","author":"G Lan","year":"2016","unstructured":"Lan, G., Monteiro, R.D.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math. Program. 155(1\u20132), 511\u2013547 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"521_CR13","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. Appl. 76(2), 461\u2013498 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"521_CR14","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s12532-021-00205-x","volume":"13","author":"F Li","year":"2021","unstructured":"Li, F., Qu, Z.: An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization. Math. Program. Comput. 13(3), 583\u2013644 (2021)","journal-title":"Math. Program. Comput."},{"key":"521_CR15","unstructured":"Li, Z., Chen, P.-Y., Liu, S., Lu, S., Xu, Y.: Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 2170\u20132178. PMLR (2021)"},{"key":"521_CR16","first-page":"7453","volume":"36","author":"Z Li","year":"2022","unstructured":"Li, Z., Chen, P.-Y., Liu, S., Lu, S., Xu, Y.: Zeroth-order optimization for composite problems with functional constraints. Proc. AAAI Conf. Artif. Intell. 36, 7453\u20137461 (2022)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"4","key":"521_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/ijoo.2021.0052","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. Informs J. Optim. 3(4), 373\u2013397 (2021)","journal-title":"Informs J. Optim."},{"issue":"1","key":"521_CR18","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 method for constrained smooth non-convex optimization. Comput. Optim. Appl. 82(1), 175\u2013224 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"521_CR19","unstructured":"Lu, S.: A single-loop gradient descent and perturbed ascent algorithm for nonconvex functional constrained optimization. In: International Conference on Machine Learning, pp. 14315\u201314357. PMLR (2022)"},{"key":"521_CR20","first-page":"20566","volume":"33","author":"L Luo","year":"2020","unstructured":"Luo, L., Ye, H., Huang, Z., Zhang, T.: Stochastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems. Adv. Neural. Inf. Process. Syst. 33, 20566\u201320577 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"521_CR21","unstructured":"Ma, R., Lin, Q., Yang, T.: Proximally constrained methods for weakly convex optimization with weakly convex constraints. arXiv:1908.01871 (2019)"},{"key":"521_CR22","unstructured":"Ma, R., Lin, Q., Yang, T.: Quadratically regularized subgradient methods for weakly convex optimization with weakly convex constraints. In: International Conference on Machine Learning, pp. 6554\u20136564. PMLR (2020)"},{"key":"521_CR23","unstructured":"Melo, J.G., Monteiro, R.D., Wang, H.: Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems. Optimization Online (2020)"},{"issue":"5","key":"521_CR24","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1109\/TAC.2013.2294614","volume":"59","author":"I Necoara","year":"2014","unstructured":"Necoara, I., Nedelcu, V.: Rate analysis of inexact dual first-order methods application to dual decomposition. IEEE Trans. Autom. Control 59(5), 1232\u20131243 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"521_CR25","doi-asserted-by":"publisher","first-page":"3109","DOI":"10.1137\/120897547","volume":"52","author":"V Nedelcu","year":"2014","unstructured":"Nedelcu, V., Necoara, I., Tran-Dinh, Q.: Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained mpc. SIAM J. Control. Optim. 52(5), 3109\u20133134 (2014)","journal-title":"SIAM J. Control. Optim."},{"issue":"694\u2013706","key":"521_CR26","first-page":"289","volume":"231","author":"J Neyman","year":"1933","unstructured":"Neyman, J., Pearson, E.S.: Containing papers of a mathematical or physical character. Ix. on the problem of the most efficient tests of statistical hypotheses. Philos. Trans. Roy. Soc. Lond. Ser. A 231(694\u2013706), 289\u2013337 (1933)","journal-title":"Philos. Trans. Roy. Soc. Lond. Ser. A"},{"issue":"1","key":"521_CR27","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E., Jr.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imag. Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"521_CR28","unstructured":"Rakhlin, A., Shamir, O., Sridharan, K.: Making gradient descent optimal for strongly convex stochastic optimization. In: Proceedings of the 29th International Conference on International Conference on Machine Learning, pp. 1571\u20131578 (2012)"},{"issue":"Oct","key":"521_CR29","first-page":"2831","volume":"12","author":"P Rigollet","year":"2011","unstructured":"Rigollet, P., Tong, X.: Neyman\u2013Pearson classification, convexity and stochastic constraints. J. Mach. Learn. Res. 12(Oct), 2831\u20132855 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"521_CR30","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF01580138","volume":"5","author":"RT Rockafellar","year":"1973","unstructured":"Rockafellar, R.T.: A dual approach to solving nonlinear programming problems by unconstrained optimization. Math. Program. 5(1), 354\u2013373 (1973)","journal-title":"Math. Program."},{"key":"521_CR31","unstructured":"Sahin, M.F., Alacaoglu, A., Latorre, F., Cevher, V. et\u00a0al:. An inexact augmented Lagrangian framework for nonconvex optimization with nonlinear constraints. In: Advances in Neural Information Processing Systems, pp. 13943\u201313955 (2019)"},{"key":"521_CR32","unstructured":"Shi, Q., Wang, X., Wang, H.: A momentum-based linearized augmented Lagrangian method for nonconvex constrained stochastic optimization (2022)"},{"key":"521_CR33","first-page":"11096","volume":"33","author":"Q Tran Dinh","year":"2020","unstructured":"Tran Dinh, Q., Liu, D., Nguyen, L.: Hybrid variance-reduced sgd algorithms for minimax problems with nonconvex-linear function. Adv. Neural. Inf. Process. Syst. 33, 11096\u201311107 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"521_CR34","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s10107-020-01583-1","volume":"191","author":"Q Tran-Dinh","year":"2022","unstructured":"Tran-Dinh, Q., Pham, N.H., Phan, D.T., Nguyen, L.M.: A hybrid stochastic optimization framework for composite nonconvex optimization. Math. Program. 191(2), 1005\u20131071 (2022)","journal-title":"Math. Program."},{"issue":"306","key":"521_CR35","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1090\/mcom\/3178","volume":"86","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Yuan, Y.-X.: Penalty methods with stochastic approximation for stochastic nonlinear programming. Math. Comput. 86(306), 1793\u20131820 (2017)","journal-title":"Math. Comput."},{"issue":"2","key":"521_CR36","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1137\/18M1229869","volume":"30","author":"Yangyang Xu","year":"2020","unstructured":"Xu, Yangyang: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020). https:\/\/doi.org\/10.1137\/18M1229869","journal-title":"SIAM J. Optim."},{"issue":"1","key":"521_CR37","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."},{"issue":"1","key":"521_CR38","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-019-01425-9","volume":"185","author":"Y Xu","year":"2021","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. 185(1), 199\u2013244 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"521_CR39","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10957-022-02132-w","volume":"196","author":"Y Xu","year":"2023","unstructured":"Xu, Y., Xu, Y.: Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization. J. Optim. Theory Appl. 196(1), 266\u2013297 (2023)","journal-title":"J. Optim. Theory Appl."},{"key":"521_CR40","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s12532-021-00214-w","volume":"14","author":"Y Yan","year":"2022","unstructured":"Yan, Y., Xu, Y.: Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs. Math. Program. Comput. 14, 319\u2013363 (2022)","journal-title":"Math. Program. Comput."},{"key":"521_CR41","unstructured":"Yu, H., Neely, M., Wei, X.: Online convex optimization with stochastic constraints. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"issue":"3","key":"521_CR42","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1137\/20M135474X","volume":"32","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Luo, Z.-Q.: A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization. SIAM J. Optim. 32(3), 2319\u20132346 (2022)","journal-title":"SIAM J. Optim."}],"updated-by":[{"DOI":"10.1007\/s10589-024-00598-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00521-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00521-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00521-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T10:10:33Z","timestamp":1723457433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00521-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,7]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["521"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00521-z","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10589-024-00598-0","asserted-by":"object"}]},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,7]]},"assertion":[{"value":"20 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10589-024-00598-0","URL":"https:\/\/doi.org\/10.1007\/s10589-024-00598-0","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}