Fetching the paper…
Reading the bibliography…
Distributionally robust stochastic optimization (DRSO) is an approach to optimization under uncertainty in which, instead of assuming that there is a known true underlying probability distribution, one hedges against a chosen set of distributions.
Kantorovich LV (1942) On the translocation of masses
1942
Earlier work this paper cites.
Scarf H, Arrow K, Karlin S (1958) A min-max solution of an inventory problem
1958
Earlier work this paper cites.
Kantorovich LV (1960) Mathematical methods of organizing and planning production
1960
Earlier work this paper cites.
Žáčková J (1966) On minimax solutions of stochastic linear programming problems
1966
Earlier work this paper cites.
Berger JO (1984) The robust bayesian viewpoint
1984
Earlier work this paper cites.
Dupačová J (1987) The minimax approach to stochastic programming and an illustrative application
1987
Earlier work this paper cites.
Barbour AD, Brown TC (1992) Stein’s method and point process approximation
1992
Earlier work this paper cites.
Gallego G, Moon I (1993) The distribution free newsboy problem: review and extensions
1993
Earlier work this paper cites.
Ambrosio L, Fusco N, Pallara D (2000)
2000
Earlier work this paper cites.
Munkres JR (2000)
2000
Earlier work this paper cites.
Rubner Y, Tomasi C, Guibas LJ (2000) The earth mover’s distance as a metric for image retrieval
2000
Earlier work this paper cites.
Shapiro A (2001) On duality theory of conic linear problems
2001
Earlier work this paper cites.
Gibbs AL, Su FE (2002) On choosing and bounding probability metrics
2002
Earlier work this paper cites.
Guslitser E (2002) Uncertainty-immunized solutions in linear programming
2002
Earlier work this paper cites.
Shapiro A, Kleywegt A (2002) Minimax analysis of stochastic problems
2002
Earlier work this paper cites.
Daley DJ, Vere-Jones D (2003)
2003
Earlier work this paper cites.
El Ghaoui L, Oks M, Oustry F (2003) Worst-case value-at-risk and robust portfolio optimization: A conic programming approach
2003
Earlier work this paper cites.
Villani C (2003)
2003
Earlier work this paper cites.
Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs
2004
Earlier work this paper cites.
Boyd S, Vandenberghe L (2004)
2004
Earlier work this paper cites.
Chen LH, Xia A (2004) Stein’s method, palm theory and poisson process approximation
2004
Cited alongside, same era.
Nemirovski A (2004) Prox-method with rate of convergence O(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
2004
Cited alongside, same era.
Bolley F, Villani C (2005) Weighted csiszár-kullback-pinsker inequalities and applications to transportation inequalities
2005
Cited alongside, same era.
Pardo L (2005)
2005
Cited alongside, same era.
Aliprantis CD, Border K (2006)
2006
Cited alongside, same era.
Calafiore GC, El Ghaoui L (2006) On distributionally robust chance-constrained linear programs
2006
Agarwal A, Bottou L (2014) A lower bound for the optimization of finite sums
2014
Later among the works it cites.
Fournier N, Guillin A (2014) On the rate of convergence in Wasserstein distance of the empirical measure
2014
Later among the works it cites.
Parikh N, Boyd SP (2014) Proximal algorithms
2014
Later among the works it cites.
Pflug GC, Pichler A (2014)
2014
Later among the works it cites.
Shapiro A, Dentcheva D, et al. (2014)
2014
Later among the works it cites.
Wozabal D (2014) Robustifying convex risk measures for linear portfolios: A nonparametric approach
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Erdoğan E, Iyengar G (2006) Ambiguous chance-constrained problems and robust optimization
2006
Cited alongside, same era.
Gonzalez RC, Woods RE (2006)
2006
Cited alongside, same era.
Bolley F, Guillin A, Villani C (2007) Quantitative concentration inequalities for empirical measures on non-compact spaces
2007
Cited alongside, same era.
Ling H, Okada K (2007) An efficient earth mover’s distance algorithm for robust histogram comparison
2007
Cited alongside, same era.
Popescu I (2007) Robust mean-covariance solutions for stochastic optimization
2007
Cited alongside, same era.
Villani C (2008)
2008
Cited alongside, same era.
Bayraksan G, Love DK (2015) Data-driven stochastic programming using phi-divergences
2015
Later among the works it cites.
Jiang R, Guan Y (2015) Data-driven chance constrained stochastic program
2015
Later among the works it cites.
Owhadi H, Scovel C (2015) Extreme points of a ball about a measure with finite support
2015
Later among the works it cites.
Sun H, Xu H (2015) Convergence analysis for distributionally robust optimization and equilibrium problems
2015
Later among the works it cites.
Wang Z, Glynn PW, Ye Y (2015) Likelihood robust optimization for data-driven problems
2015
Later among the works it cites.
2017
Closest in time.
Esfahani PM, Kuhn D (2018) Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations
2018
Closest in time.
Lan G, Zhou Y (2018) An optimal randomized incremental gradient method
2018
Closest in time.
Zhao C, Guan Y (2018) Data-driven risk-averse stochastic optimization with wasserstein metric
2018
Closest in time.
Blanchet J, Kang Y, Murthy K (2019) Robust wasserstein profile inference and applications to machine learning
2019
Closest in time.
Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport
2019
Closest in time.
Blanchet J, Murthy K, Si N (2021) Confidence Regions in Wasserstein Distributionally Robust Estimation
2021
Closest in time.
Yue MC, Kuhn D, Wiesemann W (2021) On linear optimization over wasserstein balls
2021
Closest in time.