The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Abstract
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In previous contributions, it has been shown that solutions to uncertain convex programs that bear a high probability to satisfy uncertain constraints can be obtained at low computational cost through constraint randomization. In this paper, we establish new feasibility results for randomized algorithms. Specifically, the exact feasibility for the class of the so-called fully-supported problems is obtained. It turns out that all fully-supported problems share the same feasibility properties, revealing a deep kinship among problems of this class. It is further proven that the feasibility of the randomized solutions for all other convex programs can be bounded based on the feasibility for the prototype class of fully-supported problems. The feasibility result of this paper outperforms previous bounds and is not improvable because it is exact for fully-supported problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Chance-Constrained Programming
Charnes, A., & Cooper, W. W. (1959) · Management Science · doi:10.1287/mnsc.6.1.73 · Cited by 2,742
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Robust solutions of uncertain linear programs
Ben-Tal, A., & Nemirovski, A. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(99)00016-4 · Cited by 1,829
The Scenario Approach to Robust Control Design
Calafiore, G. C., & Campi, M. C. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.875041 · Cited by 1,150
Self-citationRobust Solutions to Least-Squares Problems with Uncertain Data
El Ghaoui, L., & Lebret, H. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896298130 · Cited by 1,076
Robust Solutions to Uncertain Semidefinite Programs
El Ghaoui, L., Oustry, F., & Lebret, H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305717 · Cited by 935
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
Self-citationEfficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
Smith, R. L. (1984) · Operations Research · doi:10.1287/opre.32.6.1296 · Cited by 531
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
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
Ambiguous chance constrained problems and robust optimization
Erdoğan, E., & Iyengar, G. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0678-0 · Cited by 302
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
Ben-Tal, A., Nemirovski, A., & Roos, C. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401392354 · Cited by 189
Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
Calafiore, G. C., Dabbene, F., & Tempo, R. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/9.895560 · Cited by 159
Stochastic algorithms for exact and approximate feasibility of robust LMIs
Calafiore, G. C., & Polyak, B. T. (2001) · IEEE Transactions on Automatic Control · doi:10.1109/9.964685 · Cited by 132
(1995) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-88272-2 · Cited by 120
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
A practical guide to robust optimization
Gorissen, B. L., Yanıkoğlu, İ., & den Hertog, D. (2015) · Omega · doi:10.1016/j.omega.2014.12.006 · Cited by 636
Data-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
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
Frameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
Metadata
- Authors
- Campi, M. C., & Garatti, S.
- Venue
- SIAM Journal on Optimization
- Published
- 2008-01
- Volume
- 19
- Issue
- 3
- Pages
- 1211-1230
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1976466849
- Cited by
- 560
- References
- 16
- FWCI
- 21.01
- 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.