{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:12:40Z","timestamp":1776845560611,"version":"3.51.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T00:00:00Z","timestamp":1296777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10107-011-0442-6","type":"journal-article","created":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T23:20:59Z","timestamp":1296688859000},"page":"425-458","source":"Crossref","is-referenced-by-count":70,"title":["Validation analysis of mirror descent stochastic approximation method"],"prefix":"10.1007","volume":"134","author":[{"given":"Guanghui","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkadi","family":"Nemirovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shapiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,4]]},"reference":[{"key":"442_CR1","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"Bregman L.M.: The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"Comput. Math. Math. Phys."},{"key":"442_CR2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A.J. Kleywegt","year":"2001","unstructured":"Kleywegt A.J., Shapiro A., Homem-de-Mello T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12, 479\u2013502 (2001)","journal-title":"SIAM J. Optim."},{"key":"442_CR3","volume-title":"Simulation Modeling and Analysis","author":"A.M. Law","year":"2007","unstructured":"Law A.M.: Simulation Modeling and Analysis. McGraw Hill, New York (2007)"},{"key":"442_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C. Lemarechal","year":"1995","unstructured":"Lemarechal C., Nemirovski A., Nesterov Yu.: New variants of bundle methods. Math. Program. 69, 111\u2013148 (1995)","journal-title":"Math. Program."},{"key":"442_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J. Linderoth","year":"2006","unstructured":"Linderoth J., Shapiro A., Wright S.: The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142, 215\u2013241 (2006)","journal-title":"Ann. Oper. Res."},{"key":"442_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"W.K. Mak","year":"1999","unstructured":"Mak W.K., Morton D.P., Wood R.K.: Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24, 47\u201356 (1999)","journal-title":"Oper. Res. Lett."},{"key":"442_CR7","unstructured":"Nemirovskii, A., Yudin, D.: On Cezari\u2019s convergence of the steepest descent method for approximating saddle point of convex-concave functions. (in Russian)\u2014Doklady Akademii Nauk SSSR, 239, 5 (1978) (English translation: Soviet Math. Dokl. 19, 2 (1978))"},{"key":"442_CR8","unstructured":"Nemirovski A., Yudin D.: Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics, Wiley, XV (1983)"},{"key":"442_CR9","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, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"442_CR10","first-page":"425","volume":"83","author":"V.I. Norkin","year":"1998","unstructured":"Norkin V.I., Pflug G.Ch., Ruszczy\u0144ski A.: A branch and bound method for stochastic global optimization. Math. Program. 83, 425\u2013450 (1998)","journal-title":"Math. Program."},{"key":"442_CR11","first-page":"98","volume":"7","author":"B.T. Polyak","year":"1990","unstructured":"Polyak B.T.: New stochastic approximation type procedures. Automat. i Telemekh. 7, 98\u2013107 (1990) (English translation: Automation and Remote Control)","journal-title":"Automat. i Telemekh."},{"key":"442_CR12","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"B.T. Polyak","year":"1992","unstructured":"Polyak B.T., Juditsky A.B.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30, 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"442_CR13","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 spproximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"442_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"R.T. Rockafellar","year":"2000","unstructured":"Rockafellar R.T., Uryasev S.P.: Optimization of conditional value-at-risk. The Journal of Risk 2, 21\u201341 (2000)","journal-title":"The Journal of Risk"},{"key":"442_CR15","volume-title":"Stochastic Programming, Handbook in OR & MS, vol. 10","author":"A. Shapiro","year":"2003","unstructured":"Shapiro A.: Monte Carlo sampling methods. In: Ruszczy\u0144ski, A., Shapiro, A. (eds) Stochastic Programming, Handbook in OR & MS, vol. 10, North-Holland Publishing Company, Amsterdam (2003)"},{"key":"442_CR16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/0-387-26771-9_4","volume-title":"Continuous Optimization: Current Trends and Applications","author":"A. Shapiro","year":"2005","unstructured":"Shapiro A., Nemirovski A.: On complexity of stochastic programming problems. In: Jeyakumar, V., Rubinov, A.M. (eds) Continuous Optimization: Current Trends and Applications, pp. 111\u2013144. Springer, New York (2005)"},{"key":"442_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B. Verweij","year":"2003","unstructured":"Verweij B., Ahmed S., Kleywegt A.J., Nemhauser G., Shapiro A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24, 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"442_CR18","unstructured":"Wang, W., Ahmed, S.: Sample average approximation of expected value constrained stochastic programs, E-print available at: http:\/\/www.optimization-online.org (2007)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0442-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0442-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0442-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:09Z","timestamp":1559109009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0442-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["442"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0442-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,4]]}}}