Fetching the paper…
Reading the bibliography…
Distributionally-robust optimization is often studied for a fixed set of distributions rather than time-varying distributions that can drift significantly over time (which is, for instance, the case in finance and sociology due to underlying expansion of economy and evolution of demographics).
H. E. Scarf, “Studies in the mathematical theory of inventory and production,” in A Min–Max Solution of an Inventory Problem
1958
Earlier work this paper cites.
L. V. Kantorovich and G. S. Rubinshtein, “On a space of totally additive functions,” Vestnik, Leningrad University
1958
Earlier work this paper cites.
W. I. Zangwill, “Non-linear programming via penalty functions,” Management science
1967
Earlier work this paper cites.
T. Pietrzykowski, “An exact potential method for constrained maxima,” SIAM Journal on Numerical Analysis
1969
Earlier work this paper cites.
D. Bertsimas and M. Sim, “The price of robustness,” Operations research
2004
Earlier work this paper cites.
Springer Science & Business Media, 2006
J. Nocedal and S. Wright, Numerical optimization · 2006
Earlier work this paper cites.
E. Erdoğan and G. Iyengar, “Ambiguous chance constrained problems and robust optimization,” Mathematical Programming
2006
Earlier work this paper cites.
G. Pflug and D. Wozabal, “Ambiguity in portfolio selection,” Quantitative Finance
2007
Earlier work this paper cites.
3 ed., 2009
A. Shapiro, D. Dentcheva, and A. Ruszczyński, eds., Lectures on Stochastic Programming · 2009
Earlier work this paper cites.
Princeton University Press, 2009
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski, Robust optimization · 2009
Earlier work this paper cites.
H. Xu and S. Mannor, “A Kalman filter design based on the performance/robustness tradeoff,” IEEE transactions on automatic control
2009
Earlier work this paper cites.
E. Delage and Y. Ye, “Distributionally robust optimization under moment uncertainty with application to data-driven problems,” Operations research
2010
Earlier work this paper cites.
J. Goh and M. Sim, “Distributionally robust optimization and its tractable approximations,” Operations research
2010
Earlier work this paper cites.
N. Chehrazi and T. A. Weber, “Monotone approximation of decision problems,” Operations Research
2010
Earlier work this paper cites.
D. Wozabal, “A framework for optimization under ambiguity,” Annals of Operations Research
2012
Cited alongside, same era.
B. C. Levy and R. Nikoukhah, “Robust state space filtering under incremental model perturbations subject to a relative entropy tolerance,” IEEE Transactions on Automatic Control
2012
Cited alongside, same era.
O. Catoni, “Challenging the empirical mean and empirical variance: A deviation study,” in Annales de l’Institut Henri Poincaré, Probabilités et Statistiques
2012
Cited alongside, same era.
A. Ben-Tal, D. Den Hertog, A. De Waegenaere, B. Melenberg, and G. Rennen, “Robust solutions of optimization problems affected by uncertain probabilities,” Management Science
2013
Cited alongside, same era.
Z. Hu and L. J. Hong, “Kullback-leibler divergence constrained distributionally robust optimization,” Available at Optimization Online
2013
Athena Scientific Belmont, 2015
D. P. Bertsekas and A. Scientific, Convex optimization algorithms · 2015
Later among the works it cites.
A. Mokhtari, S. Shahrampour, A. Jadbabaie, and A. Ribeiro, “Online optimization in dynamic environments: Improved regret rates for strongly convex problems,” in 2016 IEEE 55th Conference on Decision and Control (CDC)
2016
Later among the works it cites.
K. Postek, D. den Hertog, and B. Melenberg, “Computationally tractable counterparts of distributionally robust constraints on risk measures,” SIAM Review
2016
Later among the works it cites.
R. Jiang and Y. Guan, “Data-driven chance constrained stochastic program,” Mathematical Programming
2016
Later among the works it cites.
M. Zorzi, “Robust kalman filtering under model perturbations,” IEEE Transactions on Automatic Control
2016
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.
M. Mevissen, E. Ragnoli, and J. Y. Yu, “Data-driven distributionally robust polynomial optimization,” in Advances in Neural Information Processing Systems
2013
Cited alongside, same era.
S. Agrawal and N. R. Devanur, “Fast algorithms for online stochastic convex programming,” in Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
2014
Cited alongside, same era.
E. Hazan and S. Kale, “Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization,” The Journal of Machine Learning Research
2014
Cited alongside, same era.
W. Wiesemann, D. Kuhn, and M. Sim, “Distributionally robust convex optimization,” Operations Research
2014
Cited alongside, same era.
Springer Series in Operations Research and Financial Engineering, Springer International Publishing, 2014
G. C. Pflug and A. Pichler, Multistage Stochastic Optimization · 2014
Cited alongside, same era.
N. Parikh and S. Boyd, “Proximal algorithms,” Foundations and Trends in optimization
2014
Cited alongside, same era.
S. S. Abadeh, P. M. Esfahani, and D. Kuhn, “Distributionally robust logistic regression,” in Advances in Neural Information Processing Systems
2015
Cited alongside, same era.
A. Sinha, H. Namkoong, and J. Duchi, “Certifiable distributional robustness with principled adversarial training,” in Proceedings of the Machine Learning and Computer Security Workshop (co-located with Conference on Neural Information Processing Systems 2017)
2017
Later among the works it cites.
P. M. Esfahani and D. Kuhn, “Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations,” Mathematical Programming
2018
Later among the works it cites.
D. D. Selvaratnam, I. Shames, J. H. Manton, and M. Zamani, “Numerical optimisation of time-varying strongly convex functions subject to time-varying constraints,” in 2018 IEEE Conference on Decision and Control (CDC)
2018
Later among the works it cites.
D. Kuhn, P. M. Esfahani, V. A. Nguyen, and S. Shafieezadeh-Abadeh, “Wasserstein distributionally robust optimization: Theory and applications in machine learning,” in Operations Research & Management Science in the Age of Analytics
2019
Later among the works it cites.
R. Dixit, A. S. Bedi, R. Tripathi, and K. Rajawat, “Online learning with inexact proximal online gradient descent algorithms,” IEEE Transactions on Signal Processing
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Closest in time.
Cambridge University Press, 2020
A. Prügel-Bennett, The Probability Companion for Engineering and Computer Science · 2020
Closest in time.