Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 189

The DOI matches its Crossref record.

Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems

Ben-Tal, A., Nemirovski, A., Roos, C. · 2002 · SIAM Journal on Optimization

Abstract

We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set ${\cal U}$. The robust counterpart of such a problem leads usually to an NP-hard semidefinite problem; this is the case, for example, when ${\cal U}$ is given as the intersection of ellipsoids or as an n-dimensional box. For these cases we build a single, explicit semidefinite program, which approximates the NP-hard robust counterpart, and we derive an estimate on the quality of the approximation, which is essentially independent of the dimensions of the underlying conic-quadratic problem.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s1052623401392354

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 189

Metadata

Authors
Ben-Tal, A., Nemirovski, A., & Roos, C.
Venue
SIAM Journal on Optimization
Published
2002-01
Volume
13
Issue
2
Pages
535-560
ISSN
  • 1052-6234 (ISSN-L)
  • 1095-7189
OpenAlex
W2071439977
Cited by
189
References
0
FWCI
4.33
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems. https://app.cochat.ai/papers/10.1137/s1052623401392354
The paper
Ben-Tal, A., Nemirovski, A., & Roos, C. (2002). Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623401392354

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.