The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Convex Approximations of Chance Constrained Programs
Abstract
We consider a chance constrained problem, where one seeks to minimize a convex objective over solutions satisfying, with a given close to one probability, a system of randomly perturbed convex constraints. This problem may happen to be computationally intractable; our goal is to build its computationally tractable approximation, i.e., an efficiently solvable deterministic optimization program with the feasible set contained in the chance constrained problem. We construct a general class of such convex conservative approximations of the corresponding chance constrained problem. Moreover, under the assumptions that the constraints are affine in the perturbations and the entries in the perturbation vector are independent‐of‐each‐other random variables, we build a large deviation‐type approximation, referred to as “Bernstein approximation,” of the chance constrained problem. This approximation is convex and efficiently solvable. We propose a simulation‐based scheme for bounding the optimal value in the chance constrained problem and report numerical experiments aimed at comparing the Bernstein and well‐known scenario approximation approaches. Finally, we extend our construction to the case of ambiguous chance constrained problems, where the random perturbations are independent with the collection of distributions known to belong to a given convex compact set rather than to be known exactly, while the chance constraint should be satisfied for every distribution given by this set.
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
Artzner, P., Delbaen, F., Eber, J., & Heath, D. (1999) · Mathematical Finance · doi:10.1111/1467-9965.00068 · Cited by 8,806
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
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
Stochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
Self-citationRobust Optimization of Large-Scale Systems
Mulvey, J. M., Vanderbei, R. J., & Zenios, S. A. (1995) · Operations Research · doi:10.1287/opre.43.2.264 · Cited by 1,944
Robust solutions of Linear Programming problems contaminated with uncertain data
Ben-Tal, A., & Nemirovski, A. (2000) · Mathematical Programming · doi:10.1007/pl00011380 · Cited by 1,744
Self-citationPrékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Robust optimization ? methodology and applications
Ben-Tal, A., & Nemirovski, A. (2002) · Mathematical Programming · doi:10.1007/s101070100286 · Cited by 1,409
Self-citation
Cited by
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
Stochastic Optimization for Unit Commitment—A Review
Zheng, Q. P., Wang, J., & Liu, A. L. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2355204 · Cited by 643
Data-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
Infrastructure planning for electric vehicles with battery swapping
Mak, H.-Y., Rong, Y., & Shen, Z.-J. M. (2013) · Management Science · doi:10.1287/mnsc.1120.1672 · Cited by 570
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications
Pagnoncelli, B. K., Ahmed, S., & Shapiro, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9523-6 · Cited by 523
Self-citationFrameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
Bienstock, D., Chertkov, M., & Harnett, S. (2014) · SIAM Review · doi:10.1137/130910312 · Cited by 496
Data-driven chance constrained stochastic program
Jiang, R., & Guan, Y. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0929-7 · Cited by 485
A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
Campi, M. C., & Garatti, S. (2011) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9754-6 · Cited by 398
Constructing Uncertainty Sets for Robust Linear Optimization
Bertsimas, D., & Brown, D. B. (2009) · Operations Research · doi:10.1287/opre.1080.0646 · Cited by 343
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Stochastic linear Model Predictive Control with chance constraints – A review
Farina, M., Giulioni, L., & Scattolini, R. (2016) · Journal of Process Control · doi:10.1016/j.jprocont.2016.03.005 · Cited by 342
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
Chen, W., Sim, M., Sun, J., & Teo, C.-P. (2010) · Operations Research · doi:10.1287/opre.1090.0712 · Cited by 318
Power systems optimization under uncertainty: A review of methods and applications
Roald, L. A., Pozo, D., Papavasiliou, A., Molzahn, D. K., Kazempour, J., & Conejo, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108725 · Cited by 317
Monte Carlo sampling-based methods for stochastic optimization
Homem-de-Mello, T., & Bayraksan, G. (2014) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2014.05.001 · Cited by 283
Grossmann, I. E., & Guillén-Gosálbez, G. (2010) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2009.11.012 · Cited by 274
A Distributionally Robust Optimization Based Method for Stochastic Model Predictive Control
Li, B., Tan, Y., Wu, A.-G., & Duan, G.-R. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3124750 · Cited by 156
Theory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
Energy-Efficient Processing and Robust Wireless Cooperative Transmission for Edge Inference
Yang, K., Shi, Y., Yu, W., & Ding, Z. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2979523 · Cited by 65
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
Bootstrap Robust Prescriptive Analytics
Bertsimas, D., & Van Parys, B. (2017) · arXiv · doi:10.48550/arxiv.1711.09974 · Cited by 51
Metadata
- Authors
- Nemirovski, A., & Shapiro, A.
- Venue
- SIAM Journal on Optimization
- Published
- 2007-01
- Volume
- 17
- Issue
- 4
- Pages
- 969-996
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2099506495
- Cited by
- 1,160
- References
- 21
- FWCI
- 29.26
- 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.