On Distributionally Robust Multistage Convex Optimization: Data-Driven Models and Performance

References

• Baucke R, Downward A, Zakeri G (2017) A deterministic algorithm for solving multistage stochastic programming problems. Optimization Online 1–25.Google Scholar
• Baucke R, Downward A, Zakeri G (2018) A deterministic algorithm for solving stochastic minimax dynamic programmes. Optimization Online (January 30), https://optimization-online.org/?p=15013.Google Scholar
• Bayraksan G, Love DK (2015) Data-driven stochastic programming using phi-divergences. INFORMS TutORials Oper. Res. 1:1–19. Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization, vol. 28 (Princeton University Press, Princeton, NJ).Google Scholar
• Ben-Tal A, Den Hertog D, De Waegenaere A, Melenberg B, Rennen G (2013) Robust solutions of optimization problems affected by uncertain probabilities. Management Sci. 59(2):341–357.Link, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018) Data-driven robust optimization. Math. Programming 167(2):235–292.Google Scholar
• Bezanson J, Edelman A, Karpinski S, Shah VB (2017) Julia: A fresh approach to numerical computing. SIAM Rev. 59(1):65–98.Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
• Ding L, Ahmed S, Shapiro A (2019) A python package for multistage stochastic programming. Optimization Online 1–42.Google Scholar
• Dunning I, Huchette J, Lubin M (2017) Jump: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Google Scholar
• Duque D, Morton DP (2020) Distributionally robust stochastic dual dynamic programming. SIAM J. Optim. 30(4):2841–2865.Google Scholar
• Eichhorn A, Römisch W (2005) Polyhedral risk measures in stochastic programming. SIAM J. Optim. 16(1):69–95.Google Scholar
• Esfahani PM, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1):115–166.Google Scholar
• Fournier N, Guillin A (2015) On the rate of convergence in Wasserstein distance of the empirical measure. Probab. Theory Related Fields 162(3):707–738.Google Scholar
• Gao RUI, Kleywegt A (2023) Distributionally robust stochastic optimization with Wasserstein distance. Math Oper. Res. 48(2):603–655. Link, Google Scholar
• Georghiou A, Tsoukalas A, Wiesemann W (2019) Robust dual dynamic programming. Oper. Res. 67(3):813–830.Link, Google Scholar
• Girardeau P, Leclere V, Philpott AB (2015) On the convergence of decomposition methods for multistage stochastic convex programs. Math. Oper. Res. 40(1):130–145.Link, Google Scholar
• Guigues V (2016) Convergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programs. SIAM J. Optim. 26(4):2468–2494.Google Scholar
• Guigues V, Römisch W (2012) Sampling-based decomposition methods for multistage stochastic programs based on extended polyhedral risk measures. SIAM J. Optim. 22(2):286–312.Google Scholar
• Gurobi Optimization, LLC (2022) Gurobi Optimizer Reference Manual. Accessed October 1, 2022, https://www.gurobi.com.Google Scholar
• Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• Komiya H (1988) Elementary proof for Sion’s minimax theorem. Kodai Math. J. 11(1):5–7.Google Scholar
• Kozmík V, Morton DP (2015) Evaluating policies in risk-averse multi-stage stochastic programming. Math. Programming 152(1):275–300.Google Scholar
• Lan G (2022a) Complexity of stochastic dual dynamic programming. Math. Programming. 191(2):717–754.Google Scholar
• Lan G (2022b) Correction to: Complexity of stochastic dual dynamic programming. Math. Programming 194(1):1187–1189.Google Scholar
• Li CL, Kouvelis P (1999) Flexible and risk-sharing supply contracts under price uncertainty. Management Sci. 45(10):1378–1398.Link, Google Scholar
• Lin F, Fang X, Gao Z (2022) Distributionally robust optimization: A review on theory and applications. Numer. Algebra Control Optim. 12(1):159–212.Google Scholar
• Löhndorf N, Shapiro A (2019) Modeling time-dependent randomness in stochastic dual dynamic programming. Eur. J. Oper. Res. 273(2):650–661.Google Scholar
• Park H, Jia Z, Hanasusanto GA (2022) Data-driven stochastic dual dynamic programming: Performance guarantees and regularization schemes. Optimization Online (December 20), https://optimization-online.org/?p=21376.Google Scholar
• Pereira MV, Pinto LM (1991) Multi-stage stochastic optimization applied to energy planning. Math. Programming 52(1):359–375.Google Scholar
• Philpott AB, Guan Z (2008) On the convergence of stochastic dual dynamic programming and related methods. Oper. Res. Lett. 36(4):450–455.Google Scholar
• Philpott A, de Matos V, Finardi E (2013) On solving multistage stochastic programs with coherent risk measures. Oper. Res. 61(4):957–970.Link, Google Scholar
• Philpott AB, de Matos VL, Kapelevich L (2018) Distributionally robust sddp. Comput. Management Sci. 15(3):431–454.Google Scholar
• Pichler A, Shapiro A (2021) Mathematical foundations of distributionally robust multistage optimization. SIAM J. Optim. 31(4):3044–3067.Google Scholar
• Rahimian H, Mehrotra S (2019) Distributionally robust optimization: A review. Preprint, submitted August 13, https://arxiv.org/abs/1908.05659.Google Scholar
• Rahimian H, Bayraksan G, Homem-de Mello T (2019) Identifying effective scenarios in distributionally robust stochastic programs with total variation distance. Math. Programming 173(1):393–430.Google Scholar
• Scarf HE (1957) A Min-Max Solution of an Inventory Problem (Rand Corporation, Santa Monica, CA).Google Scholar
• Shapiro A (2011) Analysis of stochastic dual dynamic programming method. Eur. J. Oper. Res. 209(1):63–72.Google Scholar
• Shapiro A, Ahmed S (2004) On a class of minimax stochastic programs. SIAM J. Optim. 14(4):1237–1249.Google Scholar
• Shapiro A, Dentcheva D, Ruszczynski A (2021) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).Google Scholar
• Shapiro A, Tekaya W, da Costa JP, Soares MP (2012) Final report for technical cooperation between georgia institute of technology and ons-operador nacional do sistema elétrico. Georgia Tech ISyE Rep., Georgia Institute of Technology, Atlanta.Google Scholar
• Shapiro A, Tekaya W, da Costa JP, Soares MP (2013) Risk neutral and risk averse stochastic dual dynamic programming method. Eur. J. Oper. Res. 224(2):375–391.Google Scholar
• Vershynin R (2018) High-Dimensional Probability: An Introduction with Applications in Data Science, vol. 47 (Cambridge University Press, Cambridge, UK).Google Scholar
• Villani C (2008) Optimal Transport: Old and New, vol. 338 (Springer, Berlin, Heidelberg).Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Zhang S, Sun XA (2020) On distributionally robust multistage convex optimization: New algorithms and complexity analysis. Preprint, submitted October 14, https://arxiv.org/abs/2010.06759.Google Scholar
• Zhang S, Sun XA (2022) Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization. Math. Programming 196(1):935–985.Google Scholar
• Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with Wasserstein metric. Oper. Res. Lett. 46(2):262–267.Google Scholar