{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T05:52:18Z","timestamp":1771998738712,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T00:00:00Z","timestamp":1357862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10589-012-9528-1","type":"journal-article","created":{"date-parts":[[2013,1,10]],"date-time":"2013-01-10T21:04:00Z","timestamp":1357851840000},"page":"265-309","source":"Crossref","is-referenced-by-count":17,"title":["On sample size control in sample average approximations for solving smooth stochastic programs"],"prefix":"10.1007","volume":"55","author":[{"given":"Johannes O.","family":"Royset","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,11]]},"reference":[{"key":"9528_CR1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.jbankfin.2005.04.012","volume":"30","author":"S. Alexander","year":"2006","unstructured":"Alexander, S., Coleman, T.F., Li, Y.: Minimizing CVaR and VaR for a portfolio of derivatives. J.\u00a0Bank. Finance 30, 583\u2013605 (2006)","journal-title":"J.\u00a0Bank. Finance"},{"key":"9528_CR2","first-page":"13.1","volume-title":"Seminaire d\u2019Analyze Convexe","author":"H. Attouch","year":"1990","unstructured":"Attouch, H., Wets, R.J.-B.: Epigraphical processes: laws of large numbers for random lsc functions. In: Seminaire d\u2019Analyze Convexe, Montpellier, pp. 13.1\u201313.29 (1990)"},{"issue":"1","key":"9528_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10287-005-0044-y","volume":"3","author":"F. Bastin","year":"2006","unstructured":"Bastin, F., Cirillo, C., Toint, P.L.: An adaptive Monte Carlo algorithm for computing mixed logit estimators. Comput. Manag. Sci. 3(1), 55\u201379 (2006)","journal-title":"Comput. Manag. Sci."},{"issue":"4","key":"9528_CR4","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1287\/opre.1110.0926","volume":"59","author":"G. Bayraksan","year":"2011","unstructured":"Bayraksan, G., Morton, D.P.: A sequential sampling procedure for stochastic programming. Oper. Res. 59(4), 898\u2013913 (2011)","journal-title":"Oper. Res."},{"key":"9528_CR5","volume-title":"Dynamic Programming and Optimal Control","author":"D.P. Bertsekas","year":"2007","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edn. Athena Scientific, Belmont (2007)","edition":"3"},{"key":"9528_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1099-1514(199801\/02)19:1<1::AID-OCA616>3.0.CO;2-Q","volume":"19","author":"J.T. Betts","year":"1998","unstructured":"Betts, J.T., Huffman, W.P.: Mesh refinement in direct transcription methods for optimal control. Optim. Control Appl. 19, 1\u201321 (1998)","journal-title":"Optim. Control Appl."},{"key":"9528_CR7","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure. Wiley, New York (1995)"},{"key":"9528_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10107-007-0164-y","volume":"117","author":"G. Deng","year":"2009","unstructured":"Deng, G., Ferris, M.C.: Variable-number sample-path optimization. Math. Program., Ser. B 117, 81\u2013109 (2009)","journal-title":"Math. Program., Ser. B"},{"key":"9528_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61370-8","volume-title":"Numerical Techniques for Stochastic Optimization","author":"Y. Ermoliev","year":"1988","unstructured":"Ermoliev, Y.: Stochastic quasigradient methods. In: Ermoliev, Y., J-B Wets, R.J.-B. (eds.) Numerical Techniques for Stochastic Optimization. Springer, New York (1988)"},{"key":"9528_CR10","unstructured":"Gill, P.E., Hammarling, S.J., Murray, W., Saunders, M.A., Wright, M.H.: LSSOL 1.0 User\u2019s guide. Technical Report SOL-86-1, System Optimization Laboratory, Stanford University, Stanford, CA (1986)"},{"key":"9528_CR11","unstructured":"Grant, M., Boyd CVX, S.: Matlab software for disciplined convex programming, version 1.21 (2010). http:\/\/cvxr.com\/cvx"},{"issue":"3","key":"9528_CR12","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/9.50336","volume":"35","author":"L. He","year":"1990","unstructured":"He, L., Polak, E.: Effective diagonalization strategies for the solution of a class of optimal design problems. IEEE Trans. Autom. Control 35(3), 258\u2013267 (1990)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9528_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4115-8","volume-title":"Stochastic Decomposition: a Statistical Method for Large Scale Stochastic Linear Programming","author":"J.L. Higle","year":"1996","unstructured":"Higle, J.L., Sen, S.: Stochastic Decomposition: a Statistical Method for Large Scale Stochastic Linear Programming. Springer, New York (1996)"},{"key":"9528_CR14","unstructured":"Holmstrom, K.: Tomlab optimization (2009). http:\/\/tomopt.com"},{"issue":"2","key":"9528_CR15","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/858481.858483","volume":"13","author":"T. Homem-de-Mello","year":"2003","unstructured":"Homem-de-Mello, T.: Variable-sample methods for stochastic optimization. ACM Trans. Model. Comput. Simul. 13(2), 108\u2013133 (2003)","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"1","key":"9528_CR16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.45.1.86","volume":"45","author":"T. Homem-de-Mello","year":"1999","unstructured":"Homem-de-Mello, T., Shapiro, A., Spearman, M.L.: Finding optimal material release times using simulation-based optimization. Manag. Sci. 45(1), 86\u2013102 (1999)","journal-title":"Manag. Sci."},{"issue":"3","key":"9528_CR17","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.1060.0367","volume":"55","author":"J. Hu","year":"2007","unstructured":"Hu, J., Fu, M.C., Marcus, S.I.: A model reference adaptive search method for global optimization. Oper. Res. 55(3), 549\u2013568 (2007)","journal-title":"Oper. Res."},{"key":"9528_CR18","volume-title":"Planning Under Uncertainty: Solving Large-Scale Stochastic Linear Programs","author":"G. Infanger","year":"1994","unstructured":"Infanger, G.: Planning Under Uncertainty: Solving Large-Scale Stochastic Linear Programs. Thomson Learning, Washington (1994)"},{"key":"9528_CR19","volume-title":"Stochastic Linear Programming, Models, Theory, and Computation","author":"P. Kall","year":"2005","unstructured":"Kall, P., Meyer, J.: Stochastic Linear Programming, Models, Theory, and Computation. Springer, Berlin (2005)"},{"key":"9528_CR20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10898-005-1655-0","volume":"34","author":"W. Kohn","year":"2006","unstructured":"Kohn, W., Zabinsky, Z.B., Brayman, V.: Optimization of algorithmic parameters using a meta-control approach. J. Glob. Optim. 34, 293\u2013316 (2006)","journal-title":"J. Glob. Optim."},{"key":"9528_CR21","volume-title":"Stochastic Approximation and Recursive Algorithms and Applications","author":"H.J. Kushner","year":"2003","unstructured":"Kushner, H.J., Yin, G.G.: Stochastic Approximation and Recursive Algorithms and Applications, 2nd edn. Springer, New York (2003)","edition":"2"},{"key":"9528_CR22","unstructured":"Lan, G.: Convex optimization under inexact first-order information. PhD thesis, Georgia Institute of Technology, Atlanta, GA (2009)"},{"key":"9528_CR23","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":"9528_CR24","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":"9528_CR25","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10898-008-9292-z","volume":"43","author":"O. Molvalioglu","year":"2009","unstructured":"Molvalioglu, O., Zabinsky, Z.B., Kohn, W.: The interacting-particle algorithm with dynamic heating and cooling. J. Glob. Optim. 43, 329\u2013356 (2009)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"9528_CR26","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1103\/PhysRevE.64.046127","volume":"64","author":"T. Munakata","year":"2001","unstructured":"Munakata, T., Nakamura, Y.: Temperature control for simulated annealing. Phys. Rev. E 64(4), 46\u2013127 (2001)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"9528_CR27","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."},{"key":"9528_CR28","first-page":"425","volume":"83","author":"V.I. Norkin","year":"1998","unstructured":"Norkin, V.I., Pflug, G.C., Ruszczynski, A.: A branch and bound method for stochastic global optimization. Math. Program. 83, 425\u2013450 (1998)","journal-title":"Math. Program."},{"key":"9528_CR29","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1111\/j.1475-3995.2009.00722.x","volume":"16","author":"J. Oppen","year":"2009","unstructured":"Oppen, J., Woodruff, D.L.: Parametric models of local search progress. Int. Trans. Oper. Res. 16, 627\u2013640 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"9528_CR30","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.1090.0773","volume":"58","author":"R. Pasupathy","year":"2010","unstructured":"Pasupathy, R.: On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58, 889\u2013901 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"9528_CR31","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/s10957-010-9759-1","volume":"148","author":"E.Y. Pee","year":"2011","unstructured":"Pee, E.Y., Royset, J.O.: On solving large-scale finite minimax problems using exponential smoothing. J. Optim. Theory Appl. 148(2), 390\u2013421 (2011)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9528_CR32","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/S0363012900369599","volume":"41","author":"O. Pironneau","year":"2002","unstructured":"Pironneau, O., Polak, E.: Consistent approximations and approximate functions and gradients in optimal control. SIAM J. Control Optim. 41(2), 487\u2013510 (2002)","journal-title":"SIAM J. Control Optim."},{"key":"9528_CR33","volume-title":"Optimization. Algorithms and Consistent Approximations","author":"E. Polak","year":"1997","unstructured":"Polak, E.: Optimization. Algorithms and Consistent Approximations. Springer, New York (1997)"},{"key":"9528_CR34","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.cam.2007.02.014","volume":"217","author":"E. Polak","year":"2008","unstructured":"Polak, E., Royset, J.O.: Efficient sample sizes in stochastic nonlinear programming. J. Comput. Appl. Math. 217, 301\u2013310 (2008)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"9528_CR35","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1023\/B:JOTA.0000006685.60019.3e","volume":"119","author":"E. Polak","year":"2003","unstructured":"Polak, E., Royset, J.O., Womersley, R.S.: Algorithms with adaptive smoothing for finite minimax problems. J. Optim. Theory Appl. 119(3), 459\u2013484 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"9528_CR36","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1016\/S0378-4266(02)00271-6","volume":"26","author":"R.T. Rockafellar","year":"2002","unstructured":"Rockafellar, R.T., Uryasev, S.: Conditional value-at-risk for general loss distributions. J. Bank. Finance 26, 1443\u20131471 (2002)","journal-title":"J. Bank. Finance"},{"issue":"1\u20132","key":"9528_CR37","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-011-0453-3","volume":"135","author":"J.O. Royset","year":"2012","unstructured":"Royset, J.O.: Optimality functions in stochastic programming. Math. Program. 135(1\u20132), 293\u2013321 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"9528_CR38","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/B:JOTA.0000041734.06199.71","volume":"122","author":"J.O. Royset","year":"2004","unstructured":"Royset, J.O., Polak, E.: Implementable algorithm for stochastic programs using sample average approximations. J. Optim. Theory Appl. 122(1), 157\u2013184 (2004)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9528_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-007-9178-0","volume":"133","author":"J.O. Royset","year":"2007","unstructured":"Royset, J.O., Polak, E.: Extensions of stochastic optimization results from problems with simple to problems with complex failure probability functions. J. Optim. Theory Appl. 133(1), 1\u201318 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"9528_CR40","first-page":"307","volume-title":"Structural Design Optimization Considering Uncertainties","author":"J.O. Royset","year":"2008","unstructured":"Royset, J.O., Polak, E.: Sample average approximations in reliability-based structural optimization: theory and applications. In: Papadrakakis, M., Tsompanakis, Y., Lagaros, N.D. (eds.) Structural Design Optimization Considering Uncertainties, pp. 307\u2013334. Taylor & Francis, London (2008)"},{"issue":"1","key":"9528_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623402406777","volume":"14","author":"J.O. Royset","year":"2003","unstructured":"Royset, J.O., Polak, E., Der Kiureghian, A.: Adaptive approximations and exact penalization for the solution of generalized semi-infinite min-max problems. SIAM J. Optim. 14(1), 1\u201334 (2003)","journal-title":"SIAM J. Optim."},{"key":"9528_CR42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The Cross-Entropy Method: a Unified Combinatorial Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning","author":"R.Y. Rubinstein","year":"2004","unstructured":"Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: a Unified Combinatorial Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer, New York (2004)"},{"key":"9528_CR43","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1145\/1276958.1277215","volume-title":"GECCO\u201907: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation","author":"K. Sastry","year":"2007","unstructured":"Sastry, K., Goldberg, D.E.: Let\u2019s get ready to rumble redux: crossover versus mutation head to head on exponentially scaled problems. In: GECCO\u201907: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1380\u20131387. ACM, New York (2007)"},{"issue":"4","key":"9528_CR44","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/S0363012994267352","volume":"34","author":"A. Schwartz","year":"1996","unstructured":"Schwartz, A., Polak, E.: Consistent approximations for optimal control problems based on Runge-Kutta integration. SIAM J. Control Optim. 34(4), 1235\u20131269 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"9528_CR45","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02204815","volume":"30","author":"A. Shapiro","year":"1991","unstructured":"Shapiro, A.: Asymptotic analysis of stochastic programs. Ann. Oper. Res. 30, 169\u2013186 (1991)","journal-title":"Ann. Oper. Res."},{"key":"9528_CR46","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A. Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)"},{"key":"9528_CR47","first-page":"301","volume":"81","author":"A. Shapiro","year":"1998","unstructured":"Shapiro, A., Homem-de-Mello, T.: A simulation-based approach to two-stage stochastic programming with recourse. Math. Program. 81, 301\u2013325 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9528_CR48","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1287\/moor.21.3.615","volume":"21","author":"A. Shapiro","year":"1996","unstructured":"Shapiro, A., Wardi, Y.: Convergence analysis of stochastic algorithms. Math. Oper. Res. 21(3), 615\u2013628 (1996)","journal-title":"Math. Oper. Res."},{"key":"9528_CR49","doi-asserted-by":"crossref","DOI":"10.1002\/0471722138","volume-title":"Introduction to Stochastic Search and Optimization","author":"J.C. Spall","year":"2003","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization. Wiley, New York (2003)"},{"issue":"2\u20133","key":"9528_CR50","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.: Sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24(2\u20133), 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"9528_CR51","volume-title":"Search and Detection","author":"A.R. Washburn","year":"2002","unstructured":"Washburn, A.R., Search and Detection, 4th edn. INFORMS, Linthicum (2002)","edition":"4"},{"key":"9528_CR52","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-008-0214-0","volume":"119","author":"H. Xu","year":"2009","unstructured":"Xu, H., Zhang, D.: Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications. Math. Program. 119, 371\u2013401 (2009)","journal-title":"Math. Program."},{"key":"9528_CR53","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1011211101714","volume":"20","author":"S. Xu","year":"2001","unstructured":"Xu, S.: Smoothing method for minimax problems. Comput. Optim. Appl. 20, 267\u2013279 (2001)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9528-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9528-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9528-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T05:15:43Z","timestamp":1562562943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9528-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,11]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9528-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,11]]}}}