Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach

References

• Ariyawansa KA, Felt AJ (2004) On a new collection of stochastic linear programming test problems. INFORMS J. Comput. 16(3):291–299.Link, Google Scholar
• Asmussen S, Glynn PW (2007) Stochastic Simulation: Algorithms and Analysis, Stochastic Simulation: Algorithms and Analysis, Stochastic Modelling and Applied Probability, Vol. 57 (Springer-Verlag, New York).Crossref, Google Scholar
• Barrera J, Homem-de-Mello T, Moreno E, Pagnoncelli BK, Canessa G (2014) Chance-constrained problems and rare events: An importance sampling approach. Accessed April 10, 2015, http://www.optimization-online.org/DB_FILE/2014/02/4250.pdf.Google Scholar
• Bayraksan G, Morton DP (2011) A sequential sampling procedure for stochastic programming. Oper. Res. 59(4):898–913.Link, Google Scholar
• Bayraksan G, Pierre-Louis P (2012) Fixed-width sequential stopping rules for a class of stochastic programs. SIAM J. Optim. 22(4):1518–1548.Crossref, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer, New York).Crossref, Google Scholar
• Bucklew JA (2004) Introduction to Rare Event Simulation, Springer Series in Statistics (Springer-Verlag, New York).Crossref, Google Scholar
• Dantzig GB, Glynn PW (1990) Parallel processors for planning under uncertainty. Ann. Oper. Res. 22(1):1–21.Crossref, Google Scholar
• Devroye L, Györfi L (1985) Nonparametric Density Estimation: The L1 View, Wiley Series in Probability and Mathematical Statistics (John Wiley & Sons, New York).Google Scholar
• Drew SS, Homem-de-Mello T (2008) Quasi-Monte Carlo strategies for stochastic optimization. Perrone LF, Lawson BF, Liu J, Wieland FP, eds. Proc. 38th Conf. Winter Simulation, Monterey, CA, 774–782.Google Scholar
• Dupačová J, Gröwe-Kuska N, Römisch W (2003) Scenario reduction in stochastic programming. Math. Programming 95(3):493–511.Crossref, Google Scholar
• Gelman A, Brooks S, Jones G, Meng XL (2010) Handbook of Markov Chain Monte Carlo: Methods and Applications (Chapman & Hall/CRC, Boca Raton, FL).Google Scholar
• Gondzio J, Grothey A (2006) Direct solution of linear systems of size 109 arising in optimization with interior point methods. Wyrzykowski R, Dongarra J, Meyer N, Waśniewski J, eds. Parallel Processing and Applied Mathematics, LNCS 3911 (Springer, Berlin), 513–525.Crossref, Google Scholar
• Haario H, Saksman E, Tamminen J (2001) An adaptive Metropolis algorithm. Bernoulli 7(2):223–242.Crossref, Google Scholar
• Hall P, Lahiri SN, Truong YK (1995) On bandwidth choice for density estimation with dependent data. Ann. Statist. 23(6):2241–2263.Crossref, Google Scholar
• Higle JL (1998) Variance reduction and objective function evaluation in stochastic linear programs. INFORMS J. Comput. 10(2):236–247.Link, Google Scholar
• Higle JL, Sen S (1991) Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16(3):650–669.Link, Google Scholar
• Homem-de-Mello T (2008) On rates of convergence for stochastic optimization problems under non-independent and identically distributed sampling. SIAM J. Optim. 19(2):524–551.Crossref, Google Scholar
• Homem-de-Mello T, de Matos V, Finardi E (2011) Sampling strategies and stopping sriteria for stochastic dual dynamic programming: A case study in long-term hydrothermal scheduling. Energy Systems 2(1):1–31.Crossref, Google Scholar
• Infanger G (1992) Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann. Oper. Res. 39(1):69–95.Crossref, Google Scholar
• Koivu M (2005) Variance reduction in sample approximations of stochastic programs. Math. Programming 103(3):463–485.Crossref, Google Scholar
• Kozmık V, Morton DP (2014) Evaluating policies in risk-averse multistage stochastic programming. Math. Programming, ePub ahead of print May 13, http://www.link.springer.com/article/10.1007/s10107-014-0787-8.Google Scholar
• Linderoth J, Shapiro A, Wright S (2006) The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1):215–241.Crossref, Google Scholar
• Lubin M, Petra CG, Anitescu M, Zavala V (2011) Scalable stochastic optimization of complex energy systems. Lathrop S, ed. High Performance Comput., Networking, Storage Anal. (SC), 2011 Internat. Conf. (IEEE, Piscataway, NJ), 1–10.Crossref, Google Scholar
• Morton DP (1998) Stopping rules for a class of sampling-based stochastic programming algorithms. Oper. Res. 46(5):710–718.Link, Google Scholar
• Neddermeyer JC (2009) Computationally efficient nonparametric importance sampling. J. Amer. Statist. Assoc. 104(486):788–802.Crossref, Google Scholar
• Parpas P, Rustem B (2007) Computational assessment of nested Benders and augmented Lagrangian decomposition for mean-variance multistage stochastic problems. INFORMS J. Comput. 19(2):239–247.Link, Google Scholar
• Pennanen T, Koivu M (2005) Epi-convergent discretizations of stochastic programs via integration quadratures. Numerische Mathematik 100(1):141–163.Crossref, Google Scholar
• Pereira MVF, Pinto L (1991) Multi-stage stochastic optimization applied to energy planning. Math. Programming 52(1):359–375.Crossref, Google Scholar
• Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality, Vol. 703 (Wiley-Blackwell, Hoboken, NJ).Crossref, Google Scholar
• Ravindran AR, ed. (2008) Operations Research and Management Science Handbook, Operations Research Series (CRC Press, Boca Raton, FL).Crossref, Google Scholar
• Roberts GO, Rosenthal JS (2004) General state space Markov chains and MCMC algorithms. Probab. Surv. 1:20–71.Crossref, Google Scholar
• Rockafellar RT, Wets RJ-B (1991) Scenarios and policy aggregation in optimization under uncertainty. Math. Oper. Res. 16(1):119–147.Link, Google Scholar
• Scott D (1992) Multivariate Density Estimation: Theory, Practice, and Visualization, 1st ed. (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Shapiro A (2009) On a time consistency concept in risk averse multistage stochastic programming. Oper. Res. Lett. 37(3):143–147.Crossref, Google Scholar
• Shapiro A (2011) Analysis of stochastic dual dynamic programming method. Eur. J. Oper. Res. 209(1):63–72.Crossref, Google Scholar
• Shapiro A, Homem-de-Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math. Programming 81(3):301–325.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński AP (2009) Lectures on Stochastic Programming: Modeling and Theory, Vol. 9 (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Silverman BW (1986) Density Estimation for Statistics and Data Analysis, 1st ed. (Chapman and Hall, Boca Raton, FL).Crossref, Google Scholar
• Ustun B (2012) The Markov Chain Monte Carlo approach to importance sampling in stochastic programming. Master’s thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Watson J-P, Wets RJ-B, Woodruff DL (2010) Scalable heuristics for a class of chance-constrained stochastic programs. INFORMS J. Comput. 22(4):543–554.Link, Google Scholar
• Zhang P (1996) Nonparametric importance sampling. J. Amer. Statist. Assoc. 91(435):1245–1253.Crossref, Google Scholar