{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:50:22Z","timestamp":1771307422846,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s12532-021-00214-w","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T11:06:18Z","timestamp":1643886378000},"page":"319-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs"],"prefix":"10.1007","volume":"14","author":[{"given":"Yonggui","family":"Yan","sequence":"first","affiliation":[]},{"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"214_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 308\u2013318 (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"214_CR2","unstructured":"Aybat, N.S., Iyengar, G.: An augmented Lagrangian method for conic convex programming. arXiv preprint arXiv:1302.6322 (2013)"},{"issue":"1","key":"214_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2005","unstructured":"Calafiore, G., Campi, M.C.: Uncertain convex programs: randomized solutions and confidence levels. Math. Progr. 102(1), 25\u201346 (2005)","journal-title":"Math. Progr."},{"issue":"5","key":"214_CR4","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"GC Calafiore","year":"2006","unstructured":"Calafiore, G.C., Campi, M.C.: The scenario approach to robust control design. IEEE Trans. Autom. Control 51(5), 742\u2013753 (2006)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"214_CR5","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"214_CR6","unstructured":"Dozat, T.: Incorporating Nesterov momentum into adam. Dostupn\u00e9 z: http:\/\/cs229.stanford.edu\/proj2015\/054_report. pdf (2016)"},{"key":"214_CR7","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"issue":"Jul","key":"214_CR8","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(Jul), 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"214_CR9","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014)"},{"key":"214_CR10","doi-asserted-by":"crossref","unstructured":"Grant, M.C., Boyd, S.P.: Graph implementations for nonsmooth convex programs. In: Recent Advances in Learning and Control, pp. 95\u2013110. Springer (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"issue":"1","key":"214_CR11","first-page":"3790","volume":"17","author":"M Gupta","year":"2016","unstructured":"Gupta, M., Cotter, A., Pfeifer, J., Voevodski, K., Canini, K., Mangylov, A., Moczydlowski, W., Van Esbroeck, A.: Monotonic calibrated interpolated look-up tables. J. Mach. Learn. Res. 17(1), 3790\u20133836 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"214_CR12","first-page":"545","volume":"17","author":"I Guyon","year":"2004","unstructured":"Guyon, I., Gunn, S., Ben-Hur, A., Dror, G.: Result analysis of the nips 2003 feature selection challenge. Adv. Neural Inf. Process. Syst. 17, 545\u2013552 (2004)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"214_CR13","unstructured":"Hamedani, E.Y., Jalilzadeh, A., Aybat, N.S., Shanbhag, U.V.: Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems. arXiv preprint arXiv:1806.04118 (2018)"},{"key":"214_CR14","unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm for general convex\u2013concave saddle point problems. arXiv preprint arXiv:1803.01401 (2018)"},{"key":"214_CR15","unstructured":"Hien, L.T.K., Zhao, R., Haskell, W.B.: An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems. arXiv preprint arXiv:1711.03669 (2017)"},{"issue":"1","key":"214_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/10-SSY011","volume":"1","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., Tauvel, C.: Solving variational inequalities with stochastic mirror-prox algorithm. Stoch. Syst. 1(1), 17\u201358 (2011)","journal-title":"Stoch. Syst."},{"key":"214_CR17","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"214_CR18","doi-asserted-by":"publisher","first-page":"1","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, 1\u201338 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"214_CR19","unstructured":"Lin, Q., Ma, R., Yang, T.: Level-set methods for finite-sum constrained convex optimization. In: International Conference on Machine Learning, pp. 3112\u20133121 (2018)"},{"issue":"4","key":"214_CR20","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":"214_CR21","unstructured":"Lu, Z., Zhou, Z.: Iteration-complexity of first-order augmented Lagrangian methods for convex conic programming. arXiv preprint arXiv:1803.09941 (2018)"},{"issue":"2","key":"214_CR22","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"key":"214_CR23","unstructured":"Luo, L., Xiong, Y., Liu, Y., Sun, X.: Adaptive gradient methods with dynamic bound of learning rate. arXiv preprint arXiv:1902.09843 (2019)"},{"issue":"4","key":"214_CR24","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"214_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"JV Neumann","year":"1928","unstructured":"Neumann, J.V.: Zur theorie der gesellschaftsspiele. Math. Ann. 100(1), 295\u2013320 (1928)","journal-title":"Math. Ann."},{"issue":"2","key":"214_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"Oct","key":"214_CR27","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."},{"key":"214_CR28","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. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"214_CR29","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. J. Risk 2, 21\u201342 (2000)","journal-title":"J. Risk"},{"key":"214_CR30","unstructured":"Ryu, E.K., Yin, W.: Proximal\u2013proximal\u2013gradient method. arXiv preprint arXiv:1708.06908 (2017)"},{"key":"214_CR31","unstructured":"Reddi, S.J., Kale, S, Kumar, S.: On the convergence of adam and beyond. In: International Conference on Learning Representations (2018)"},{"issue":"11","key":"214_CR32","doi-asserted-by":"publisher","first-page":"3806","DOI":"10.1109\/TIT.2005.856955","volume":"51","author":"C Scott","year":"2005","unstructured":"Scott, C., Nowak, R.: A Neyman\u2013Pearson approach to statistical learning. IEEE Trans. Inf. Theory 51(11), 3806\u20133819 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"214_CR33","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM (2014)","DOI":"10.1137\/1.9781611973433"},{"issue":"2","key":"214_CR34","first-page":"26","volume":"4","author":"T Tieleman","year":"2012","unstructured":"Tieleman, T., Hinton, G.: Lecture 6.5-rmsprop: divide the gradient by a running average of its recent magnitude. COURSERA Neural Netw. Mach. Learn. 4(2), 26\u201331 (2012)","journal-title":"COURSERA Neural Netw. Mach. Learn."},{"issue":"1","key":"214_CR35","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1137\/130931278","volume":"26","author":"M Wang","year":"2016","unstructured":"Wang, M., Bertsekas, D.P.: Stochastic first-order methods with random constraint projection. SIAM J. Optim. 26(1), 681\u2013717 (2016)","journal-title":"SIAM J. Optim."},{"key":"214_CR36","unstructured":"Wang, M., Chen, Y., Liu, J., Gu, Y.: Random multi-constraint projection: Stochastic gradient methods for convex optimization with many constraints. arXiv preprint arXiv:1511.03760 (2015)"},{"issue":"1\u20132","key":"214_CR37","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-016-1017-3","volume":"161","author":"M Wang","year":"2017","unstructured":"Wang, M., Fang, E.X., Liu, H.: Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions. Math. Progr. 161(1\u20132), 419\u2013449 (2017)","journal-title":"Math. Progr."},{"key":"214_CR38","doi-asserted-by":"crossref","unstructured":"Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints. SIAM J. Optim. 30(2), 1664\u20131692 (2020)","DOI":"10.1137\/18M1229869"},{"key":"214_CR39","doi-asserted-by":"crossref","unstructured":"Xu, Y.: First-order methods for constrained convex programming based on linearized augmented Lagrangian function. INFORMS J. Optim. 3(1), 89\u2013117 (2021)","DOI":"10.1287\/ijoo.2019.0033"},{"key":"214_CR40","doi-asserted-by":"crossref","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Progr. 185, 199\u2013244 (2021)","DOI":"10.1007\/s10107-019-01425-9"},{"issue":"4","key":"214_CR41","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1287\/ijoo.2021.0055","volume":"3","author":"Y Xu","year":"2021","unstructured":"Xu, Y., Xu, Y.: Katyusha acceleration for convex finite-sum compositional optimization. INFORMS J. Optim. 3(4), 418\u2013443 (2021)","journal-title":"INFORMS J. Optim."},{"key":"214_CR42","doi-asserted-by":"crossref","unstructured":"Yu, H., Neely, M.J.: A primal-dual type algorithm with the $${O} (1\/t)$$ convergence rate for large scale constrained convex programs. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 1900\u20131905. IEEE (2016)","DOI":"10.1109\/CDC.2016.7798542"},{"issue":"75","key":"214_CR43","first-page":"1","volume":"20","author":"MB Zafar","year":"2019","unstructured":"Zafar, M.B., Valera, I., Gomez-Rodriguez, M., Gummadi, K.P.: Fairness constraints: a flexible approach for fair classification. J. Mach. Learn. Res. 20(75), 1\u201342 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"214_CR44","unstructured":"Zafar, M.B., Valera, I., Rogriguez, M.G., Gummadi, K.P.: Fairness constraints: mechanisms for fair classification. In: Artificial Intelligence and Statistics. PMLR, pp. 962\u2013970 (2017)"},{"key":"214_CR45","unstructured":"Zeiler, M.D.: Adadelta: an adaptive learning rate method. arXiv preprint arXiv:1212.5701 (2012)"},{"key":"214_CR46","unstructured":"Zhao, R.: Optimal stochastic algorithms for convex\u2013concave saddle-point problems. arXiv preprint arXiv:1903.01687 (2019)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-021-00214-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-021-00214-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-021-00214-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T16:12:36Z","timestamp":1652544756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-021-00214-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s12532-021-00214-w","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"20 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}