Stochastic Cutting Planes for Data-Driven Optimization

References

• Achterberg T, Wunderling R (2013) Mixed Integer Programming: Analyzing 12 Years of Progress. Facets of Combinatorial Optimization (Springer, Berlin).Google Scholar
• Alley M, Biggs M, Hariss R, Herrmann C, Li M, Perakis G (2022) Pricing for heterogeneous products: Analytics for ticket reselling. Manufacturing Service Oper. Management, ePub ahead of print February 11, https://doi.org/10.1287/msom.2021.1065.Google Scholar
• Bardenet R, Maillard OA (2015) Concentration inequalities for sampling without replacement. Bernoulli 21(3):1361–1385.Crossref, Google Scholar
• Bertsimas D, Li ML (2018) Interpretable matrix completion: A discrete optimization approach. Preprint, submitted December 17, https://arxiv.org/abs/1812.06647.Google Scholar
• Bertsimas D, Van Parys B (2020) Sparse high-dimensional regression: Exact scalable algorithms and phase transitions. Ann. Statist. 48(1):300–323.Crossref, Google Scholar
• Bixby R, Rothberg E (2007) Progress in computational mixed integer programming: A look back from the other side of the tipping point. Ann. Oper. Res. 149(1):37–41.Crossref, Google Scholar
• Blundell RW, Powell JL (2004) Endogeneity in semiparametric binary response models. Rev. Econom. Stud. 71(3):655–679.Crossref, Google Scholar
• Calafiore G, Campi MC (2005) Uncertain convex programs: Randomized solutions and confidence levels. Math. Programming 102(1):25–46.Crossref, Google Scholar
• Caruana R, Joachims T, Backstrom L (2004) Kdd-cup 2004: Results and analysis. SIGKDD Exploration 6(2):95–108.Crossref, Google Scholar
• Chang CC, Lin CJ (2011) Libsvm: A library for support vector machines. ACM Trans. Intelligent Systems Tech. 2(3):1–27.Crossref, Google Scholar
• Dua D, Graff C (2017) UCI machine learning repository. Accessed February 1, 2021, http://archive.ics.uci.edu/ml.Google Scholar
• Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3):307–339.Crossref, Google Scholar
• Fletcher R, Leyffer S (1994) Solving mixed integer nonlinear programs by outer approximation. Math. Programming 66(1-3):327–349.Crossref, Google Scholar
• Franc V, Sonnenburg S (2008) Optimized cutting plane algorithm for support vector machines. Cohen W (general chair), ed. Proc. 25th Internat. Conf. on Machine Learn., 320–327.Google Scholar
• Franc V, Sonnenburg S (2009) Optimized cutting plane algorithm for large-scale risk minimization. J. Machine Learn. Res. 10(10):2157–2192.Google Scholar
• Franc V, Sonnenburg S, Werner T (2011) Cutting plane methods in machine learning. Sra S, Nowozin S, Wright SJ, eds. Optimization for Machine Learning (MIT Press, Cambridge, MA), 185–218.Google Scholar
• Joachims T (2006) Training linear svms in linear time. Elissa-Rad T (general chair), ed. Proc. 12th ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, 217–226.Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Parikh S (1976) Approximate cutting planes in nonlinear programming. Math. Programming 11(1):194–198.Crossref, Google Scholar
• Razaviyayn M (2014) Successive convex approximation: Analysis and applications. PhD thesis, University of Minnesota, Minneapolis.Google Scholar
• Rivers D, Vuong QH (1988) Limited information estimators and exogeneity tests for simultaneous probit models. J. Econometrics 39(3):347–366.Crossref, Google Scholar
• Volkov Y, Zavriev S (1997) A general stochastic outer approximations method. SIAM J. Control Optim. 35(4):1387–1421.Crossref, Google Scholar
• Wei J, Realff MJ (2004) Sample average approximation methods for stochastic minlps. Comput. Chemical Engrg. 28(3):333–346.Crossref, Google Scholar