Efficient sample sizes in stochastic nonlinear programming
暂无分享,去创建一个
[1] James V. Burke,et al. Calmness and exact penalization , 1991 .
[2] Alexander Shapiro,et al. A simulation-based approach to two-stage stochastic programming with recourse , 1998, Math. Program..
[3] M. Talagrand,et al. Probability in Banach spaces , 1991 .
[4] Johannes O. Royset,et al. Algorithms with Adaptive Smoothing for Finite Minimax Problems , 2003 .
[5] E. Polak,et al. Extensions of Stochastic Optimization Results to Problems with System Failure Probability Functions , 2007 .
[6] Stephen M. Robinson,et al. Sample-path optimization of convex stochastic performance functions , 1996, Math. Program..
[7] R. Tyrrell Rockafellar,et al. Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming , 1993, Math. Oper. Res..
[8] R. Wets,et al. Epi‐consistency of convex stochastic programs , 1991 .
[9] Armen Der Kiureghian,et al. Optimal design with probabilistic objective and constraints , 2006 .
[10] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .
[11] Peter Kall,et al. Stochastic Programming , 1995 .
[12] Elijah Polak,et al. Effective diagonalization strategies for the solution of a class of optimal design problems , 1990 .
[13] Elijah Polak,et al. Optimization: Algorithms and Consistent Approximations , 1997 .