Technical note -- two-stage sample robust optimization
From MaRDI portal
Abstract: We investigate a simple approximation scheme, based on overlapping linear decision rules, for solving data-driven two-stage distributionally robust optimization problems with the type- Wasserstein ambiguity set. Our main result establishes that this approximation scheme is asymptotically optimal for two-stage stochastic linear optimization problems; that is, under mild assumptions, the optimal cost and optimal first-stage decisions obtained by approximating the robust optimization problem converge to those of the underlying stochastic problem as the number of data points grows to infinity. These guarantees notably apply to two-stage stochastic problems that do not have relatively complete recourse, which arise frequently in applications. In this context, we show through numerical experiments that the approximation scheme is practically tractable and produces decisions which significantly outperform those obtained from state-of-the-art data-driven alternatives.
Recommendations
- Distributionally Robust Two-Stage Stochastic Programming
- A stochastic dual dynamic programming method for two-stage distributionally robust optimization problems
- A model of distributionally robust two-stage stochastic convex programming with linear recourse
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
Cites work
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A distributional interpretation of robust optimization
- Adjustable robust solutions of uncertain linear programs
- Ambiguous chance constrained problems and robust optimization
- Analysis of Sample-Path Optimization
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally Robust Convex Optimization
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Epi‐consistency of convex stochastic programs
- Finite Adaptability in Multistage Linear Optimization
- Foundations of Optimization
- Integer Programming
- Introduction to stochastic programming.
- Lectures on Stochastic Programming
- Linear programming under uncertainty
- On the Rate of Convergence of Empirical Measures in ∞-transportation Distance
- On the power and limitations of affine policies in two-stage adaptive optimization
- On the rate of convergence in Wasserstein distance of the empirical measure
- On the rate of convergence of empirical measure in -Wasserstein distance for unbounded density function
- On two-stage convex chance constrained problems
- Risk-averse two-stage stochastic program with distributional ambiguity
- Robust Combinatorial Optimization with Exponential Scenarios
- Scenario approximations of chance constraints
- Tractable reformulations of two-stage distributionally robust linear programs over the type-\(\infty\) Wasserstein ball
- Uncertain linear programs: extended affinely adjustable robust counterparts
- K-adaptability in two-stage robust binary programming
Cited in
(22)- Deep empirical risk minimization in finance: Looking into the future
- Effective scenarios in multistage distributionally robust optimization with a focus on total variation distance
- Distributionally robust optimization
- A sample robust optimal bidding model for a virtual power plant
- Benchmarking problems for robust discrete optimization
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- Optimizing integrated berth allocation and quay crane assignment: a distributionally robust approach
- Two-stage distributionally robust conic linear programming over 1-Wasserstein balls
- Residuals-based distributionally robust optimization with covariate information
- A constraint sampling approach for multi-stage robust optimization
- Compact uncertainty sets for robust optimization based on bootstrapped Dirichlet process mixture model
- Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties
- Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
- Dynamic optimization with side information
- Solving multistage stochastic linear programming via regularized linear decision rules: an application to hydrothermal dispatch planning
- Regularized methods for a two-stage robust production planning problem and its sample average approximation
- Tractable reformulations of two-stage distributionally robust linear programs over the type-\(\infty\) Wasserstein ball
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- A primal-dual lifting scheme for two-stage robust optimization
- Saddle point approximation approaches for two-stage robust optimization problems
- Distributionally robust stochastic programs with side information based on trimmings
- Frameworks and results in distributionally robust optimization
This page was built for publication: Technical note -- two-stage sample robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031032)
