We study the out-of-sample properties of robust empirical optimization problems with smooth φ-divergence penalties and smooth concave objective functions, and develop a theory for data-driven calibration of the non-negative “robustness parameter” δ that controls the size of the deviations...

In this paper, we study the out-of-sample properties of robust empirical optimization and develop a theory for data-driven calibration of the “robustness parameter” for worst-case maximization problems with concave reward functions. Building on the intuition that robust optimization reduces...

This paper presents the R package MitISEM, which provides an automatic and flexible method to approximate a non-elliptical target density using adaptive mixtures of Student-t densities, where only a kernel of the target density is required. The approximation can be used as a candidate density in...