A review of algorithms for distributionally robust optimization using statistical distances
From MaRDI portal
Cites work
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
- Ambiguous Risk Measures and Optimal Robust Portfolios
- Bicriteria approximation of chance-constrained covering problems
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Data-Driven Optimization of Reward-Risk Ratio Measures
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
- Distributionally Robust Convex Optimization
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Distributionally robust optimization. A review on theory and applications
- Distributionally robust reward-risk ratio programming with Wasserstein metric
- Distributionally Robust Stochastic Optimization with Wasserstein Distance
- Efficient algorithms for distributionally robust stochastic optimization with discrete scenario support
- scientific article; zbMATH DE number 3130649 (Why is no real title available?)
- scientific article; zbMATH DE number 7370573 (Why is no real title available?)
- scientific article; zbMATH DE number 2221907 (Why is no real title available?)
- Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
- Likelihood robust optimization for data-driven problems
- Multi-stage distributionally robust optimization with risk aversion
- On distributionally robust chance constrained programs with Wasserstein distance
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal transport-based distributionally robust optimization: structural properties and iterative schemes
- Primal-dual hybrid gradient method for distributionally robust optimization problems
- Quantifying distributional model risk via optimal transport
- Regularization via mass transportation
- Risk-averse stochastic programming and distributionally robust optimization via operator splitting
- Risk-averse two-stage stochastic program with distributional ambiguity
- Robust analysis in stochastic simulation: computation and performance guarantees
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust Stochastic Approximation Approach to Stochastic Programming
- Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls
- Variance-based regularization with convex objectives
- Wasserstein distributionally robust optimization and variation regularization
This page was built for publication: A review of algorithms for distributionally robust optimization using statistical distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857069)
