The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
Abstract
Stochastic programming can effectively describe many decision-making problems in uncertain environments. Unfortunately, such programs are often computationally demanding to solve. In addition, their solution can be misleading when there is ambiguity in the choice of a distribution for the random parameters. In this paper, we propose a model that describes uncertainty in both the distribution form (discrete, Gaussian, exponential, etc.) and moments (mean and covariance matrix). We demonstrate that for a wide range of cost functions the associated distributionally robust (or min-max) stochastic program can be solved efficiently. Furthermore, by deriving a new confidence region for the mean and the covariance matrix of a random vector, we provide probabilistic arguments for using our model in problems that rely heavily on historical data. These arguments are confirmed in a practical example of portfolio selection, where our framework leads to better-performing policies on the “true” distribution underlying the daily returns of financial assets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Optimization of conditional value-at-risk
Rockafellar, R. T., & Uryasev, S. (2000) · The Journal of Risk · doi:10.21314/jor.2000.038 · Cited by 6,725
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Introduction to Multivariate Analysis
Lee, J. C. (1983) · Technometrics · doi:10.1080/00401706.1983.10487903 · Cited by 1,783
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Robust Portfolio Selection Problems
Goldfarb, D., & Iyengar, G. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.1.14260 · Cited by 895
Handbook of Semidefinite Programming
(2000) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-4381-7 · Cited by 781
Studies in Mathematical Theory of Inventory and Production
Vadja, S., Arrow, K. J., Karlin, S., Scarf, H., Hurwicz, L., & Uzawa, H. (1959) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402060 · Cited by 696
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
A Min-Max Solution of an Inventory Problem
Scarf, H. (2005) · Herbert Scarf’s Contributions to Economics, Game Theory and Operations Research · doi:10.1057/9781137024381_3 · Cited by 552
Studies in the Mathematical Theory of Inventory and Production
Johnston, J., Arrow, K. J., Karlin, S., & Scarf, H. E. (1960) · The Review of Economics and Statistics · doi:10.2307/1926552 · Cited by 537
On Distributionally Robust Chance-Constrained Linear Programs
Calafiore, G. C., & Ghaoui, L. E. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9084-x · Cited by 508
Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management
Zhu, S., & Fukushima, M. (2009) · Operations Research · doi:10.1287/opre.1080.0684 · Cited by 505
Pólik, I., & Terlaky, T. (2007) · SIAM Review · doi:10.1137/s003614450444614x · Cited by 499
Optimal Inequalities in Probability Theory: A Convex Optimization Approach
Bertsimas, D., & Popescu, I. (2005) · SIAM Journal on Optimization · doi:10.1137/s1052623401399903 · Cited by 428
McDiarmid, C. (1998) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12788-9_6 · Cited by 405
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0094 · Cited by 373
A Robust Optimization Perspective on Stochastic Programming
Chen, X., Sim, M., & Sun, P. (2007) · Operations Research · doi:10.1287/opre.1070.0441 · Cited by 362
Probabilistic Methods for Algorithmic Discrete Mathematics
Habib, M., McDiarmid, C., Alfonsín, J. L. R., & Reed, B. A. (1998) · Algorithms and combinatorics · doi:10.1007/978-3-662-12788-9 · Cited by 338
On Duality Theory of Conic Linear Problems
Shapiro, A. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3403-4_7 · Cited by 312
On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
Shapiro, A., & Homem‐de‐Mello, T. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623498349541 · Cited by 250
Solving convex programs by random walks
Bertsimas, D., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008733 · Cited by 242
Robust Mean-Covariance Solutions for Stochastic Optimization
Popescu, I. (2007) · Operations Research · doi:10.1287/opre.1060.0353 · Cited by 235
Operations research proceedings
Pressmar, D., Jäger, K. E., & Krallmann, H. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90174-a · Cited by 221
The uniform distribution: A rigorous justification for its use in robustness analysis
Barmish, B. R., & Lagoa, C. M. (1997) · Mathematics of Control Signals and Systems · doi:10.1007/bf01211503 · Cited by 207
The minimax approach to stochastic programming and an illustrative application
Dupačová, J. (1987) · Stochastics · doi:10.1080/17442508708833436 · Cited by 154
Theory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
TRACTABLE ROBUST EXPECTED UTILITY AND RISK MODELS FOR PORTFOLIO OPTIMIZATION
Natarajan, K., Sim, M., & UICHANCO, J. A. V. (2010) · Mathematical Finance · doi:10.1111/j.1467-9965.2010.00417.x · Cited by 129
Asymptotic Distribution of the Sample Roots for a Nonnormal Population
WATERNAUX, C. M. (1976) · Biometrika · doi:10.1093/biomet/63.3.639 · Cited by 126
Landau, H. J. (1987) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/037 · Cited by 103
Moment Problems and Semidefinite Optimization
Bertsimas, D., & Sethuraman, J. (2000) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4615-4381-7_16 · Cited by 93
Stochastic programming by Monte Carlo simulation methods
Shapiro, A. (1999) · doi:10.18452/2843 · Cited by 74
Worst-case distribution analysis of stochastic programs
Shapiro, A. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0680-6 · Cited by 29
Cited by
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Recent advances in robust optimization: An overview
Gabrel, V., Murat, C., & Thiele, A. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.036 · Cited by 912
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
Ben-Tal, A., den Hertog, D., De Waegenaere, A., Melenberg, B., & Rennen, G. (2013) · Management Science · doi:10.1287/mnsc.1120.1641 · Cited by 748
Supply chain network design under uncertainty: A comprehensive review and future research directions
Govindan, K., Fattahi, M., & Keyvanshokooh, E. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.04.009 · Cited by 705
Metadata
- Authors
- Delage, E., & Ye, Y.
- Venue
- Operations Research
- Published
- 2010-06
- Volume
- 58
- Issue
- 3
- Pages
- 595-612
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1968355947
- Cited by
- 1,893
- References
- 37
- FWCI
- 37.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.