Distributions with maximum spread subject to Wasserstein distance constraints
From MaRDI portal
Publication:2422610
DOI10.1007/s40305-018-00238-5zbMath1424.90196OpenAlexW2916801651WikidataQ128384963 ScholiaQ128384963MaRDI QIDQ2422610
Publication date: 20 June 2019
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-00238-5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the rate of convergence in Wasserstein distance of the empirical measure
- Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
- Quantitative concentration inequalities for empirical measures on non-compact spaces
- Logistics systems analysis
- Data-driven robust optimization
- Information geometry connecting Wasserstein distance and Kullback-Leibler divergence via the entropy-relaxed transportation problem
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- The earth mover's distance as a metric for image retrieval
- A framework for optimization under ambiguity
- Distributionally robust joint chance constraints with second-order moment information
- On distributionally robust chance-constrained linear programs
- Ambiguous chance constrained problems and robust optimization
- Robust Partitioning for Stochastic Multivehicle Routing
- Robustifying Convex Risk Measures for Linear Portfolios: A Nonparametric Approach
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- A Soft Robust Model for Optimization Under Ambiguity
- Information Theory and Statistical Mechanics
- Robust Mean-Covariance Solutions for Stochastic Optimization
- A Robust Optimization Perspective on Stochastic Programming
- Ambiguous Risk Measures and Optimal Robust Portfolios
- On constrained optimization by adjoint based quasi-Newton methods
- Wasserstein Distance and the Distributionally Robust TSP
- Robust Wasserstein profile inference and applications to machine learning
- Deconvolution for the Wasserstein Metric and Geometric Inference
- Ambiguity in portfolio selection
- Robust Dynamic Programming
- Optimal Transport
This page was built for publication: Distributions with maximum spread subject to Wasserstein distance constraints