The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Robust Convex Optimization
Abstract
We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we lay the foundation of robust convex optimization. In the main part of the paper we show that if U is an ellipsoidal uncertainty set, then for some of the most important generic convex optimization problems (linear programming, quadratically constrained programming, semidefinite programming and others) the corresponding robust convex program is either exactly, or approximately, a tractable problem which lends itself to efficient algorithms such as polynomial time interior point methods.
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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Zhou, K., Doyle, J. C., & Glover, K. (1997) · Cited by 4,556
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
Doyle, J. C. (2002) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1996.572756 · Cited by 3,742
Robust 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
Soyster, A. L. (1973) · Operations Research · doi:10.1287/opre.21.5.1154 · Cited by 1,822
KACZOREK, T. (1996) · Control Engineering Practice · doi:10.1016/0967-0661(96)83721-x · Cited by 1,434
Robust Discrete Optimization and Its Applications
Kouvelis, P., & Yu, G. (1997) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-2620-6 · Cited by 1,169
Robust Discrete Optimization and Its Applications.
Gerodimos, A., Kouvelis, P., & Yu, G. (1998) · The Journal of the Operational Research Society · doi:10.2307/3010157 · Cited by 1,060
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
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
Self-citation
Cited by
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
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
Self-citationRobust discrete optimization and network flows
Bertsimas, D., & Sim, M. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0396-4 · Cited by 1,799
Metadata
- Authors
- Ben-Tal, A., & Nemirovski, A.
- Venue
- Mathematics of Operations Research
- Published
- 1998-11
- Volume
- 23
- Issue
- 4
- Pages
- 769-805
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2089105401
- Cited by
- 2,598
- References
- 12
- FWCI
- 8.96
- 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.