Optimization Online


Robust sample average approximation with small sample sizes

E.J. Anderson (edward.anderson***at***sydney.edu.au)
A.B. Philpott (a.philpott***at***auckland.ac.nz)

Abstract: We consider solving stochastic optimization problems in which we seek to minimize the expected value of an objective function with respect to an unknown distribution of random parameters. Our focus is on models that use sample average approximation (SAA) with small sample sizes. We analyse the out-of-sample performance of solutions obtained by solving a robust version of the SAA problem, and derive conditions under which these solutions are improved in comparison with SAA. We analyse three different mechanisms for constructing a robust solution: a CVaR-based risk measure, phi-divergence using total variation, and a Wasserstein metric.

Keywords: Distributionally robust optimization; sample average approximation; out-of-sample performance

Category 1: Stochastic Programming

Category 2: Robust Optimization



Entry Submitted: 02/26/2019
Entry Accepted: 02/26/2019
Entry Last Modified: 11/10/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society