Data-Driven Piecewise Affine Decision Rules for Stochastic Programming with Covariate Information

References

• Balazs G, György A, Szepesvari C (2015) Near-optimal max-affine estimators for convex regression. Proc. 18th Internat. Conf. Artificial Intelligence Statist. AISTATS (PMLR, New York), 56–64.Google Scholar
• Bampou D, Kuhn D (2011) Scenario-free stochastic programming with polynomial decision rules. 2011 50th IEEE Conf. Decision Control Eur. Control Conf. CDC-ECC (IEEE, Piscataway, NJ), 7806–7812.Google Scholar
• Ban G-Y, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108. Link, Google Scholar
• Bertsimas D, Georghiou A (2015) Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 63(3):610–627.Link, Google Scholar
• Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Bertsimas D, Koduri N (2022) Data-driven optimization: A reproducing kernel Hilbert space approach. Oper. Res. 70(1):454–471.Link, Google Scholar
• Beutel AL, Minner S (2012) Safety stock planning under causal demand forecasting. Internat. J. Production Econom. 140(2):637–645.Crossref, Google Scholar
• Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer Science & Business Media, New York).Crossref, Google Scholar
• Calafiore G, Campi MC (2005) Uncertain convex programs: Randomized solutions and confidence levels. Math. Program. 102(1):25–46.Crossref, Google Scholar
• Chen X, Sim M, Sun P, Zhang J (2008) A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2):344–357.Link, Google Scholar
• Cui Y, Pang JS (2021) Modern Nonconvex Nondifferentiable Optimization (SIAM Publications, Philadelphia).Crossref, Google Scholar
• Cui Y, Pang JS, Sen B (2018) Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4):3344–3374.Crossref, Google Scholar
• Deng Y, Sen S (2022) Predictive stochastic programming. Comput. Management Sci. 19(1):65–98.Crossref, Google Scholar
• Donti P, Amos B, Kolter JZ (2017) Task-based end-to-end model learning in stochastic optimization. 31st Conf. Neural Inform. Processing Systems NIPS 2017, vol. 30 (Curran Associates, Inc., Red Hook, NY), 5490–5500.Google Scholar
• Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize”. Management Sci. 68(1):9–26.Link, Google Scholar
• Elmachtoub AN, Lam H, Zhang H, Zhao Y (2023) Estimate-then-optimize versus integrated-estimation-optimization versus sample average approximation: A stochastic dominance perspective. Preprint, submitted April 13, https://arxiv.org/abs/2304.06833.Google Scholar
• Georghiou A, Wiesemann W, Kuhn D (2015) Generalized decision rule approximations for stochastic programming via liftings. Math. Program. 152(1):301–338.Crossref, Google Scholar
• Kallus N, Mao X (2023) Stochastic optimization forests. Management Sci. 69(4):1975–1994.Link, Google Scholar
• Kannan R, Bayraksan G, Luedtke JR (2025) Data-driven sample average approximation with covariate information. Oper. Res. 73(6):3245–3259.Link, Google Scholar
• Kao Y-h, Roy B, Yan X (2009) Directed regression. Proc. 23rd Conf. Neural Inform. Processing Systems NIPS 2009, vol. 22 (Curran Associates, Inc., Red Hook, NY), 889–897.Google Scholar
• Kingma DP, Ba J (2014) Adam: A method for stochastic optimization. Preprint, submitted December 22, https://arxiv.org/abs/1412.6980.Google Scholar
• Kuhn D, Wiesemann W, Georghiou A (2011) Primal and dual linear decision rules in stochastic and robust optimization. Math. Program. 130(1):177–209.Crossref, Google Scholar
• Kuznetsov V, Mohri M (2017) Generalization bounds for non-stationary mixing processes. Machine Learn. 106(1):93–117.Crossref, Google Scholar
• Le Thi HA, Pham Dinh T (2018) DC programming and DCA: Thirty years of developments. Math. Program. 169(1):5–68.Crossref, Google Scholar
• Le Thi HA, Huynh VN, Dinh TP, Hau Luu HP (2022) Stochastic difference-of-convex-functions algorithms for nonconvex programming. SIAM J. Optim. 32(3):2263–2293.Crossref, Google Scholar
• Lipp T, Boyd S (2016) Variations and extension of the convex–concave procedure. Optim. Eng. 17(2):263–287.Crossref, Google Scholar
• Liu J, Cui Y, Pang JS (2022) Solving nonsmooth and nonconvex compound stochastic programs with applications to risk measure minimization. Math. Oper. Res. 47(4):3051–3083.Link, Google Scholar
• Lu Z, Zhou Z, Sun Z (2019) Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176(1):369–401.Crossref, Google Scholar
• Nitanda A, Suzuki T (2017) Stochastic difference of convex algorithm and its application to training deep Boltzmann machines. Proc. 20th Internat. Conf. Artificial Intelligence Statist. AISTATS (PMLR, New York), 470–478.Google Scholar
• Notz PM, Pibernik R (2022) Prescriptive analytics for flexible capacity management. Management Sci. 68(3):1756–1775.Link, Google Scholar
• Oroojlooyjadid A, Snyder LV, Takáč M (2020) Applying deep learning to the newsvendor problem. IISE Trans. 52(4):444–463.Crossref, Google Scholar
• Pang JS, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1):95–118.Link, Google Scholar
• Pasupathy R, Song Y (2021) Adaptive sequential sample average approximation for solving two-stage stochastic linear programs. SIAM J. Optim. 31(1):1017–1048.Crossref, Google Scholar
• Qi M, Shen ZJ (2022) Integrating prediction/estimation and optimization with applications in operations management. Tutorials in Operations Research: Emerging and Impactful Topics in Operations, INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 36–58.Link, Google Scholar
• Qi M, Grigas P, Shen ZJ (2025) Integrated conditional estimation-optimization. Oper. Res., ePub ahead of print, October 28, https://doi.org/10.1287/opre.2023.0427.Link, Google Scholar
• Qi Z, Cui Y, Liu Y, Pang JS (2022) Asymptotic properties of stationary solutions of coupled nonconvex nonsmooth empirical risk minimization. Math. Oper. Res. 47(3):2034–2064.Link, Google Scholar
• Qi M, Shi Y, Qi Y, Ma C, Yuan R, Wu D, Shen ZJ (2023) A practical end-to-end inventory management model with deep learning. Management Sci. 69(2):759–773.Link, Google Scholar
• Rockafellar RT, Wets RJB (2009) Variational Analysis, vol. 317 (Springer Science & Business Media, New York).Google Scholar
• Royset JO (2020) Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation. Math. Program. 184(1):289–318.Crossref, Google Scholar
• Sadana U, Chenreddy A, Delage E, Forel A, Frejinger E, Vidal T (2025) A survey of contextual optimization methods for decision-making under uncertainty. Eur. J. Oper. Res. 320(2):271–289.Crossref, Google Scholar
• Scholtes S (2012) Introduction to Piecewise Differentiable Equations (Springer Science & Business Media, New York).Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczynski A (2021) Lectures on Stochastic Programming: Modeling and Theory (SIAM Publications, Philadelphia).Crossref, Google Scholar
• Siahkamari A, Gangrade A, Kulis B, Saligrama V (2020) Piecewise linear regression via a difference of convex functions. Proc. 37th Internat. Conf. Machine Learn. ICML (PMLR, New York), 8895–8904.Google Scholar
• Tao PD, An LH (1997) Convex analysis approach to DC programming: Theory, algorithms and applications. Acta Math. Vietnam 22(1):289–355.Google Scholar
• Tersine RJ, Barman S (1991) Economic inventory/transport lot, sizing with quantity and freight rate discounts. Decision Sci. 22(5):1171–1179.Crossref, Google Scholar
• Xu Y, Qi Q, Lin Q, Jin R, Yang T (2019) Stochastic optimization for DC functions and non-smooth non-convex regularizers with non-asymptotic convergence. Proc. 36th Internat. Conf. Machine Learn. ICML (PMLR, New York), 6942–6951.Google Scholar
• Zhang Z, Zohren S, Roberts S (2020) Deep learning for portfolio optimization. Preprint, submitted May 27, https://arxiv.org/abs/2005.13665.Google Scholar