{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:55:28Z","timestamp":1773773728862,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1637474"],"award-info":[{"award-number":["1637474"]}],"id":[{"id":"10.13039\/100000001","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":[[2020,6]]},"DOI":"10.1007\/s10589-020-00179-x","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T19:02:40Z","timestamp":1582052560000},"page":"461-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Algorithms for stochastic optimization with function or expectation constraints"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2103-087X","authenticated-orcid":false,"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[]},{"given":"Zhiqiang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,18]]},"reference":[{"issue":"3","key":"179_CR1","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"179_CR2","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"H Bauschke","year":"2003","unstructured":"Bauschke, H., Borwein, J., Combettes, P.: Bregman monotone optimization algorithms. SIAM J. Control Optim. 42, 596\u2013636 (2003)","journal-title":"SIAM J. Control Optim."},{"issue":"6","key":"179_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.orl.2010.08.005","volume":"38","author":"A Beck","year":"2010","unstructured":"Beck, A., Ben-Tal, A., Guttmann-Beck, N., Tetruashvili, L.: The comirror algorithm for solving nonsmooth constrained convex problems. Oper. Res. Lett. 38(6), 493\u2013498 (2010)","journal-title":"Oper. Res. Lett."},{"key":"179_CR4","unstructured":"Benveniste, A., M\u00e9tivier, M., Priouret, P.: Algorithmes adaptatifs et approximations stochastiques. Masson, 1987. (English translation: Adaptive Algorithms and Stochastic Approximations). Springer, Belin (1993)"},{"issue":"3","key":"179_CR5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"179_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262033589.001.0001","volume-title":"Semi-supervised Learning","author":"O Chapelle","year":"2006","unstructured":"Chapelle, O., Scholkopf, B., Zien, A.: Semi-supervised Learning. MIT Press, Cambridge, Mass (2006)"},{"issue":"4","key":"179_CR7","doi-asserted-by":"crossref","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":"179_CR8","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwright, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22, 674\u2013701 (2012)","journal-title":"SIAM J. Optim."},{"key":"179_CR9","unstructured":"Duchi, J.C., Shalev-shwartz, S., Singer, Y., Tewari, A.: Composite objective mirror descent. In: Proceedings of the Twenty Third Annual Conference on Computational Learning Theory (2010)"},{"key":"179_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/17442508308833246","volume":"9","author":"Y Ermoliev","year":"1983","unstructured":"Ermoliev, Y.: Stochastic quasigradient methods and their application to system optimization. Stochastics 9, 1\u201336 (1983)","journal-title":"Stochastics"},{"key":"179_CR11","first-page":"89","volume":"4","author":"A Gaivoronski","year":"1978","unstructured":"Gaivoronski, A.: Nonstationary stochastic programming problems. Kybernetika 4, 89\u201392 (1978)","journal-title":"Kybernetika"},{"key":"179_CR12","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, I: a generic algorithmic framework. SIAM J. Optim. 22, 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"key":"179_CR13","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1137\/110848876","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms. SIAM J. Optim. 23, 2061\u20132089 (2013)","journal-title":"SIAM J. Optim."},{"key":"179_CR14","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic optimization. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA, June 2013"},{"issue":"1","key":"179_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"D Goldfarb","year":"2003","unstructured":"Goldfarb, D., Iyengar, G.: Robust portfolio selection problems. Math. Oper. Res. 28(1), 1\u201338 (2003)","journal-title":"Math. Oper. Res."},{"key":"179_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, H., Shanbhag, U.V.: On the solution of stochastic optimization and variational problems in imperfect information regimes. arXiv preprint arXiv:1402.1457 (2014)","DOI":"10.1109\/WSC.2013.6721474"},{"key":"179_CR17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2001","unstructured":"Kleywegt, A.J., Shapiro, A., de Mello, T.H.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12, 479\u2013502 (2001)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"179_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"key":"179_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with $${{{\\cal{O}}}}(1\/\\epsilon )$$ iteration-complexity for cone programming. Math. Program. 126, 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"179_CR20","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10107-011-0442-6","volume":"134","author":"G Lan","year":"2012","unstructured":"Lan, G., Nemirovski, A.S., Shapiro, A.: Validation analysis of mirror descent stochastic approximation method. Math. Program. 134, 425\u2013458 (2012)","journal-title":"Math. Program."},{"key":"179_CR21","unstructured":"Nedic, A.: On stochastic subgradient mirror-descent algorithm with weighted averaging. Technical report (2012)"},{"issue":"4","key":"179_CR22","doi-asserted-by":"crossref","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":"4","key":"179_CR23","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM J. Optim. 17(4), 969\u2013996 (2006)","journal-title":"SIAM J. Optim."},{"key":"179_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Massachusetts (2004)"},{"key":"179_CR25","volume-title":"The Interface Between Simulation and Optimization","author":"G Pflug","year":"1996","unstructured":"Pflug, G.: Optimization of stochastic models. In: Pflug, G. (ed.) The Interface Between Simulation and Optimization. Kluwer, Boston (1996)"},{"key":"179_CR26","first-page":"98","volume":"7","author":"B Polyak","year":"1990","unstructured":"Polyak, B.: New stochastic approximation type procedures. Autom. i Telemekh. 7, 98\u2013107 (1990)","journal-title":"Autom. i Telemekh."},{"key":"179_CR27","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"B Polyak","year":"1992","unstructured":"Polyak, B., Juditsky, A.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"179_CR28","first-page":"33","volume":"174","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method of solving extremum problems. Doklady Akademii Nauk SSSR 174(1), 33 (1967)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"179_CR29","doi-asserted-by":"crossref","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":"179_CR30","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"R Rockafellar","year":"2000","unstructured":"Rockafellar, R., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201341 (2000)","journal-title":"J. Risk"},{"key":"179_CR31","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BFb0121128","volume":"28","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski, A., Sysk, W.: A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems. Math. Program. Study 28, 113\u2013131 (1986)","journal-title":"Math. Program. Study"},{"key":"179_CR32","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Minimizing finite sums with the stochastic average gradient. Technical report, September 2013"},{"key":"179_CR33","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N.: Pegasos: Primal estimated sub-gradient solver for svm. In: ICML, pp. 807\u2013814 (2007)","DOI":"10.1145\/1273496.1273598"},{"key":"179_CR34","volume-title":"Stochastic Programming","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A.: Monte carlo sampling methods. In: Ruszczy\u0144ski, A., Shapiro, A. (eds.) Stochastic Programming. North-Holland Publishing Company, Amsterdam (2003)"},{"key":"179_CR35","volume-title":"Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control","author":"JC Spall","year":"2005","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control, vol. 65. Wiley, New York (2005)"},{"key":"179_CR36","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1137\/S1052623495292130","volume":"7","author":"M Teboulle","year":"1997","unstructured":"Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7, 1069\u20131083 (1997)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"179_CR37","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.orl.2008.05.003","volume":"36","author":"W Wang","year":"2008","unstructured":"Wang, W., Ahmed, S.: Sample average approximation of expected value constrained stochastic programs. Oper. Res. Lett. 36(5), 515\u2013519 (2008)","journal-title":"Oper. Res. Lett."},{"key":"179_CR38","first-page":"2543","volume":"12","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 12, 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00179-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00179-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00179-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T22:29:09Z","timestamp":1665872949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00179-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,18]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00179-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,18]]},"assertion":[{"value":"8 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}