A Nonconvex Regularization Scheme for the Stochastic Dual Dynamic Programming Algorithm

References

• Asamov T, Powell W (2018) Regularized decomposition of high-dimensional multistage stochastic programs with Markov uncertainty. SIAM J. Optim. 28(1):575–595.Crossref, Google Scholar
• Balandat M, Karrer B, Jiang D, Daulton S, Letham B, Wilson A, Bakshy E (2020) BoTorch: A framework for efficient Monte-Carlo Bayesian optimization. Larochelle H, Ranzato M, Hadsell R, Balcan M, Lin H, eds. Advances in Neural Information Processing Systems, vol. 33 (Curran Associates, Inc., Red Hook, NY), 21524–21538.Google Scholar
• Bhattacharya A, Kharoufeh JP, Zeng B (2018) Managing energy storage in microgrids: A multistage stochastic programming approach. IEEE Trans. Smart Grid 9(1):483–496.Crossref, Google Scholar
• Bhattacharya A, Kharoufeh JP, Zeng B (2023) A nonconvex regularization scheme for the stochastic dual dynamic programming algorithm. http://dx.doi.org/10.1287/ijoc.2021.0255.cd, https://github.com/INFORMSJoC/2021.0255.Google Scholar
• Bogdan M, Van Den Berg E, Sabatti C, Su W, Candès E (2015) SLOPE: Adaptive variable selection via convex optimization. Ann. Appl. Statist. 9(3):1103.Crossref, Google Scholar
• Chen Z, Powell W (1999) Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse. J. Optim. Theory Appl. 102(3):497–524.Crossref, Google Scholar
• Dempster M, Howarth A (2006) Sequential importance sampling algorithms for dynamic stochastic programming. J. Math. Sci. (NY) 133(4):1422–1444.Crossref, Google Scholar
• Dowson O, Kapelevich L (2021) SDDP.jl: A Julia package for stochastic dual dynamic programming. INFORMS J. Comput. 33(1):27–33.Link, Google Scholar
• Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Crossref, Google Scholar
• Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Statist. Assoc. 96(456):1348–1360.Crossref, Google Scholar
• Fan J, Li R (2020) Comment: Feature screening and variable selection via iterative ridge regression. Technometrics 62(4):434–437.Crossref, Google Scholar
• Fan J, Xue L, Zou H (2014) Strong oracle optimality of folded concave penalized estimation. Ann. Statist. 42(3):819–849.Crossref, Google Scholar
• Fan J, Li R, Zhang CH, Zou H (2020) Statistical Foundations of Data Science (Chapman and Hall/CRC Press, Boca Raton, FL).Crossref, Google Scholar
• Freimer M, Linderoth J, Thomas D (2012) The impact of sampling methods on bias and variance in stochastic linear programs. Comput. Optim. Appl. 51(1):51–75.Crossref, Google Scholar
• Giannessi F, Tomasin E (1973) Nonconvex quadratic programs, linear complementarity problems, and integer linear programs. Proc. 5th Conf. on Optim. Techniques, Part 1. Lecture Notes in Computer Science (Springer, Berlin), 437–449.Google Scholar
• Girardeau P, Leclere V, Philpott A (2015) On the convergence of decomposition methods for multistage stochastic convex programs. Math. Oper. Res. 40(1):130–145.Link, Google Scholar
• Guigues V, Lejeune M, Tekaya W (2020) Regularized stochastic dual dynamic programming for convex nonlinear optimization problems. Optim. Engrg. 21:1133–1165.Crossref, Google Scholar
• Hafiz F, Chen B, Chen C, Rodrigo de Queiroz A, Husain I (2019) Utilising demand response for distribution service restoration to achieve grid resiliency against natural disasters. IET General Transmission Distribution 13(14):2942–2950.Crossref, Google Scholar
• Higle J, 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, de Matos V, Finardi E (2011) Sampling strategies and stopping criteria for stochastic dual dynamic programming: A case study in long-term hydrothermal scheduling. Energy Systems 2(1):1–31.Crossref, Google Scholar
• Horst R, Tuy H (1996) Global Optimization: Deterministic Approaches (Springer, Berlin).Crossref, Google Scholar
• Kaplan A, Tichatschke R (1998) Proximal point methods and non-convex optimization. J. Global Optim. 13(4):389–406.Crossref, Google Scholar
• Kelley J (1960) The cutting-plane method for solving convex programs. J. Soc. Industrial Appl. Math. 8(4):703–712.Crossref, Google Scholar
• Kouwenberg R (2001) Scenario generation and stochastic programming models for asset liability management. Eur. J. Oper. Res. 134(2):279–292.Crossref, Google Scholar
• Krokhmal P, Uryasev S, Palmquist J (2002) Portfolio optimization with conditional value-at-risk objective and constraints. J. Risk 4(2):43–68.Crossref, Google Scholar
• Lemaréchal C (1975) An extension of Davidon methods to nondifferentiable problems. Balinski M, Wolfe P, eds. Nondifferentiable Optimization. Mathematical Programming Studies, vol. 3 (Springer, Berlin), 95–109.Crossref, Google Scholar
• Lewis A, Overton M (2013) Nonsmooth optimization via quasi-Newton methods. Math. Programming 141(1):135–163.Crossref, 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
• Linowsky K, Philpott A (2005) On the convergence of sampling-based decomposition algorithms for multistage stochastic programs. J. Optim. Theory Appl. 125(2):349–366.Crossref, Google Scholar
• Liu H, Yao T, Li R (2016) Global solutions to folded concave penalized nonconvex learning. Ann. Statist. 44(2):629–659.Crossref, Google Scholar
• Liu H, Yao T, Li R, Ye Y (2017) Folded concave penalized sparse linear regression: Sparsity, statistical performance, and algorithmic theory for local solutions. Math. Programming 166(1):207–240.Crossref, Google Scholar
• Moore R (1991) Global optimization to prescribed accuracy. Comput. Math. Appl. 21(6):25–39.Crossref, Google Scholar
• Nesterov Y (2004) Nonsmooth Optimization. Introductory Lectures on Convex Optimization (Springer US, New York).Crossref, Google Scholar
• Park M, Hastie T (2007) L1-regularization path algorithm for generalized linear models. J. Royal Statist. Soc. Ser. B Statist. Methodology 69(4):659–677.Crossref, Google Scholar
• Pereira M, Pinto L (1991) Multi-stage stochastic optimization applied to energy planning. Math. Programming 52(1):359–375.Crossref, Google Scholar
• Philpott A, Guan Z (2008) On the convergence of stochastic dual dynamic programming and related methods. Oper. Res. Lett. 36(4):450–455.Crossref, Google Scholar
• Ralphs T, Shinano Y, Berthold T, Koch T (2018) Parallel solvers for mixed-integer linear optimization. Hamadi Y, Sais L, eds. Handbook of Parallel Constraint Reasoning (Springer International, Berlin), 283–336.Crossref, Google Scholar
• Rasmussen C, Williams C (2006) Gaussian Processes for Machine Learning (MIT Press, Cambridge, MA).Google Scholar
• Ruszczyński A (2003) Decomposition methods. Ruszczyński A, Shapiro A, eds. Handbooks in Operations Research and Management Science, vol. 10 (Elsevier, New York), 144–211.Google Scholar
• Ruszczyński A, Świȩtanowski A (1997) Accelerating the regularized decomposition method for two stage stochastic linear problems. Eur. J. Oper. Res. 101(2):328–342.Crossref, Google Scholar
• Sen S, Zhou Z (2014) Multistage stochastic decomposition: A bridge between stochastic programming and approximate dynamic programming. SIAM J. Optim. 24(1):127–153.Crossref, Google Scholar
• Shahriari B, Swersky K, Wang Z, Adams R, de Freitas N (2016) Taking the human out of the loop: A review of Bayesian optimization. Proc. IEEE 104(1):148–175.Crossref, Google Scholar
• Shapiro A (2003) Inference of statistical bounds for multistage stochastic programming problems. Math. Methods Oper. Res. 58(1):57–68.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, Tekaya W, da Costa J, Soares M (2011) Report for technical cooperation between Georgia Institute of Technology and Operador Nacional do Sistema Elétrico. Technical report, Georgia Institute of Technology, Atlanta.Google Scholar
• Shapiro A, Tekaya W, da Costa J, Soares M (2013) Risk neutral and risk averse stochastic dual dynamic programming method. Eur. J. Oper. Res. 224(2):375–391.Crossref, Google Scholar
• Tibshirani R (1996) Regression shrinkage and selection via the lasso. J. Royal Statist. Soc. B 58(1):267–288.Crossref, Google Scholar
• van Ackooij W, de Oliviera W, Song Y (2019) On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems. Comput. Optim. Appl. 74(1):1–42.Crossref, Google Scholar
• Wang B, Zhang C, Dong Z, Li X (2020) Improving hosting capacity of unbalanced distribution networks via robust allocation of battery energy storage systems. IEEE Trans. Power Systems 36(3):2174–2185.Crossref, Google Scholar
• Xu D, Chen Z, Yang L (2012) Scenario tree generation approaches using K-means and LP moment matching methods. J. Comput. Appl. Math. 236(17):4561–4579.Crossref, Google Scholar
• Zhang C (2010) Nearly unbiased variable selection under minimax concave penalty. Ann. Statist. 38(2):894–942.Crossref, Google Scholar
• Zou J, Ahmed S, Sun X (2019) Stochastic dual dynamic integer programming. Math. Programming: Ser. A 175(1–2):461–502.Crossref, Google Scholar