{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T20:24:41Z","timestamp":1782332681712,"version":"3.54.5"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271076"],"award-info":[{"award-number":["12271076"]}],"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":["12271278"],"award-info":[{"award-number":["12271278"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Major Key Project of PCL","award":["PCL2022A05"],"award-info":[{"award-number":["PCL2022A05"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10915-025-02941-x","type":"journal-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T14:09:12Z","timestamp":1747836552000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Two-phase Stochastic Momentum-Based Algorithm for Nonconvex Expectation-Constrained Optimization"],"prefix":"10.1007","volume":"104","author":[{"given":"Yawen","family":"Cui","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"}]},{"given":"Xiantao","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,21]]},"reference":[{"key":"2941_CR1","unstructured":"Alacaoglu, A., Wright, S.J.: Complexity of single loop algorithms for nonlinear programming with stochastic objective and constraints. In: International Conference on Artificial Intelligence and Statistics, pp. 4627\u20134635. PMLR (2024)"},{"key":"2941_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10107-022-01822-7","volume":"199","author":"Y Arjevani","year":"2023","unstructured":"Arjevani, Y., Carmon, Y., Duchi, J.C., Foster, D.J., Srebro, N., Woodworth, B.: Lower bounds for non-convex stochastic optimization. Mathematical Programming 199, 165\u2013214 (2023)","journal-title":"Mathematical Programming"},{"issue":"2","key":"2941_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the kurdyka-\u0142ojasiewicz inequality. Mathematics of Operations Research 35(2), 438\u2013457 (2010)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"2941_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","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-seidel methods. Mathematical Programming 137(1), 91\u2013129 (2013)","journal-title":"Mathematical Programming"},{"issue":"2","key":"2941_CR5","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/20M1354556","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Curtis, F.E., Robinson, D., Zhou, B.: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM Journal on Optimization 31(2), 1352\u20131379 (2021)","journal-title":"SIAM Journal on Optimization"},{"key":"2941_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.camwa.2023.09.014","volume":"149","author":"R Bollapragada","year":"2023","unstructured":"Bollapragada, R., Karamanli, C., Keith, B., Lazarov, B., Petrides, S., Wang, J.: An adaptive sampling augmented lagrangian method for stochastic optimization with deterministic constraints. Computers & Mathematics with Applications 149, 239\u2013258 (2023)","journal-title":"Computers & Mathematics with Applications"},{"issue":"4","key":"2941_CR7","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1287\/moor.2017.0900","volume":"43","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Nonconvex lagrangian-based optimization: monitoring schemes and global convergence. Mathematics of Operations Research 43(4), 1210\u20131232 (2018)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"2941_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10107-021-01742-y","volume":"197","author":"D Boob","year":"2023","unstructured":"Boob, D., Deng, Q., Lan, G.: Stochastic first-order methods for convex and nonconvex functional constrained optimization. Mathematical Programming 197(1), 215\u2013279 (2023)","journal-title":"Mathematical Programming"},{"key":"2941_CR9","doi-asserted-by":"crossref","unstructured":"Boob, D., Deng, Q., Lan, G.: Level constrained first order methods for function constrained optimization. Mathematical Programming (2024)","DOI":"10.1007\/s10107-024-02057-4"},{"issue":"2","key":"2941_CR10","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bo\u0163","year":"2020","unstructured":"Bo\u0163, R.I., Nguyen, D.K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Mathematics of Operations Research 45(2), 682\u2013712 (2020)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2941_CR11","first-page":"27","volume":"2","author":"CC Chang","year":"2007","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology 2(3), 27 (2007)","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"1","key":"2941_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10107-023-01981-1","volume":"205","author":"FE Curtis","year":"2024","unstructured":"Curtis, F.E., O\u2019Neill, M.J., Robinson, D.P.: Worst-case complexity of an sqp method for nonlinear equality constrained stochastic optimization. Mathematical Programming 205(1), 431\u2013483 (2024)","journal-title":"Mathematical Programming"},{"key":"2941_CR13","unstructured":"Cutkosky, A., Orabona, F.: Momentum-based variance reduction in non-convex SGD. Advances in Neural Information Processing System (2019)"},{"issue":"3","key":"2941_CR14","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/TSP.2008.2008542","volume":"57","author":"M Ding","year":"2009","unstructured":"Ding, M., Blostein, S.D.: Mimo minimum total mse transceiver design with imperfect csi at both ends. IEEE Transactions on Signal Processing 57(3), 1141\u20131150 (2009)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2941_CR15","unstructured":"Donini, M., Oneto, L., Ben-David, S., Shawe-Taylor, J.S., Pontil, M.: Empirical risk minimization under fairness constraints. Advances in Neural Information Processing Systems 31 (2018)"},{"issue":"2","key":"2941_CR16","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1137\/22M1537862","volume":"34","author":"Y Fang","year":"2024","unstructured":"Fang, Y., Na, S., Mahoney, M.W., Kolar, M.: Fully stochastic trust-region sequential quadratic programming for equality-constrained optimization problems. SIAM Journal on Optimization 34(2), 2007\u20132037 (2024)","journal-title":"SIAM Journal on Optimization"},{"key":"2941_CR17","doi-asserted-by":"crossref","unstructured":"Fang, Y., Na, S., Mahoney, M.W., Kolar, M.: Trust-region sequential quadratic programming for stochastic optimization with random models. arXiv preprint arXiv:2409.15734 (2024)","DOI":"10.1137\/22M1537862"},{"key":"2941_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., G, L., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Mathematical Programming 155, 267\u2013305 (2016)","journal-title":"Mathematical Programming"},{"key":"2941_CR19","unstructured":"Goh, G., Cotter, A., Gupta, M., Friedlander, M.P.: Satisfying real-world goals with dataset constraints. Advances in Neural Information Processing Systems 29 (2016)"},{"issue":"3","key":"2941_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/opre.1100.0910","volume":"59","author":"LJ Hong","year":"2011","unstructured":"Hong, L.J., Yang, Y., Zhang, L.: Sequential convex approximations to joint chance constrained programs: A monte carlo approach. Operations Research 59(3), 617\u2013630 (2011)","journal-title":"Operations Research"},{"issue":"1","key":"2941_CR21","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. Computational Optimization and Applications 83(1), 143\u2013180 (2022)","journal-title":"Computational Optimization and Applications"},{"issue":"351","key":"2941_CR22","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1090\/mcom\/3965","volume":"94","author":"L Jin","year":"2025","unstructured":"Jin, L., Wang, X.: Stochastic nested primal-dual method for nonconvex constrained composition optimization. Mathematics of Computation 94(351), 305\u2013358 (2025)","journal-title":"Mathematics of Computation"},{"key":"2941_CR23","first-page":"26548","volume":"34","author":"A Krishnapriyan","year":"2021","unstructured":"Krishnapriyan, A., Gholami, A., Zhe, S., Kirby, R., Mahoney, M.W.: Characterizing possible failure modes in physics-informed neural networks. Advances in Neural Information Processing Systems 34, 26548\u201326560 (2021)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2941_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.21314\/JOR.2002.057","volume":"4","author":"P Krokhmal","year":"2002","unstructured":"Krokhmal, P., Palmquist, J., Uryasev, S.: Portfolio optimization with conditional value-at-risk objective and constraints. Journal of risk 4, 43\u201368 (2002)","journal-title":"Journal of risk"},{"key":"2941_CR25","doi-asserted-by":"crossref","unstructured":"Li, Z., Chen, P.Y., Liu, S., Lu, S., Xu, Y.: Stochastic inexact augmented lagrangian method for nonconvex expectation constrained optimization. Computational Optimization and Applications pp. 1\u201331 (2023)","DOI":"10.1007\/s10589-023-00521-z"},{"issue":"1","key":"2941_CR26","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. Computational Optimization and Applications 82(1), 175\u2013224 (2022)","journal-title":"Computational Optimization and Applications"},{"key":"2941_CR27","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 (2020)"},{"issue":"1","key":"2941_CR28","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10107-022-01846-z","volume":"199","author":"S Na","year":"2023","unstructured":"Na, S., Anitescu, M., Kolar, M.: An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians. Mathematical Programming 199(1), 721\u2013791 (2023)","journal-title":"Mathematical Programming"},{"key":"2941_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-023-01935-7","volume":"202","author":"S Na","year":"2023","unstructured":"Na, S., Anitescu, M., Kolar, M.: Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming. Mathematical Programming 202, 279\u2013353 (2023)","journal-title":"Mathematical Programming"},{"key":"2941_CR30","unstructured":"Na, S., Mahoney, M.W.: Statistical inference of constrained stochastic optimization via sketched sequential quadratic programming. arXiv:2205.13687 (2022)"},{"issue":"694\u2013706","key":"2941_CR31","first-page":"289","volume":"231","author":"J Neyman","year":"1933","unstructured":"Neyman, J., Pearson, E.S.: Ix. on the problem of the most efficient tests of statistical hypotheses. Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character 231(694\u2013706), 289\u2013337 (1933)","journal-title":"Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character"},{"key":"2941_CR32","unstructured":"Rigollet, P., Tong, X.: Neyman-pearson classification, convexity and stochastic constraints. Journal of Machine Learning Research pp. 2831\u20132855 (2011)"},{"key":"2941_CR33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S., et al.: Optimization of conditional value-at-risk. Journal of Risk 2, 21\u201342 (2000)","journal-title":"Journal of Risk"},{"key":"2941_CR34","unstructured":"Sahin, M.F., Alacaoglu, A., Latorre, F., Cevher, V., et\u00a0al.: An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints. Advances in Neural Information Processing Systems 32 (2019)"},{"key":"2941_CR35","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10957-013-0513-3","volume":"163","author":"F Shan","year":"2014","unstructured":"Shan, F., Zhang, L., Xiao, X.: A smoothing function approach to joint chance-constrained programs. Journal of Optimization Theory and Applications 163, 181\u2013199 (2014)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2941_CR36","doi-asserted-by":"publisher","unstructured":"Shi, Q., Wang, X., Wang, H.: A momentum-based linearized augmented lagrangian method for nonconvex constrained stochastic optimization. Mathematics of Operations Research (2025). https:\/\/doi.org\/10.1287\/moor.2022.0193","DOI":"10.1287\/moor.2022.0193"},{"key":"2941_CR37","doi-asserted-by":"publisher","unstructured":"Wang, X.: Complexity analysis of inexact cubic-regularized primal-dual methods for finding second-order stationary points. Mathematics of Computation (2024). https:\/\/doi.org\/10.1090\/mcom\/4029","DOI":"10.1090\/mcom\/4029"},{"issue":"306","key":"2941_CR38","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.: Penalty methods with stochastic approximation for stochastic nonlinear programming. Mathematics of Computation 86(306), 1793\u20131820 (2017)","journal-title":"Mathematics of Computation"},{"key":"2941_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01409-y","volume":"86","author":"Y Xie","year":"2021","unstructured":"Xie, Y., Wright, S.J.: Complexity of proximal augmented lagrangian for nonconvex optimization with nonlinear equality constraints. Journal of Scientific Computing 86, 1\u201330 (2021)","journal-title":"Journal of Scientific Computing"},{"issue":"2","key":"2941_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 Journal on Optimization 30(2), 1664\u20131692 (2020)","journal-title":"SIAM Journal on Optimization"},{"key":"2941_CR41","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. Journal of Optimization Theory and Applications 196, 266\u2013297 (2023)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"2941_CR42","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. Mathematical Programming Computation 14(2), 319\u2013363 (2022)","journal-title":"Mathematical Programming Computation"},{"issue":"6","key":"2941_CR43","doi-asserted-by":"publisher","first-page":"2989","DOI":"10.1287\/ijoc.2022.1228","volume":"34","author":"L Zhang","year":"2022","unstructured":"Zhang, L., Zhang, Y., Wu, J., Xiao, X.: Solving stochastic optimization with expectation constraints efficiently by a stochastic augmented lagrangian-type algorithm. INFORMS Journal on Computing 34(6), 2989\u20133006 (2022)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"2941_CR44","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.2022.1257","volume":"48","author":"L Zhang","year":"2023","unstructured":"Zhang, L., Zhang, Y., Xiao, X., Wu, J.: Stochastic approximation proximal method of multipliers for convex stochastic programming. Mathematics of Operations Research 48(1), 177\u2013193 (2023)","journal-title":"Mathematics of Operations Research"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02941-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02941-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02941-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T06:41:14Z","timestamp":1750315274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02941-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,21]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2941"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02941-x","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,21]]},"assertion":[{"value":"2 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 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":"Conflict of Interest"}}],"article-number":"16"}}