The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On maximization of quadratic form over intersection of ellipsoids with common center
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Transmit beamforming for physical-layer multicasting
Sidiropoulos, N. D., Davidson, T. N., & Luo, Z.-Q. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872578 · Cited by 1,335
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
Huang, Y., & Palomar, D. P. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2031732 · Cited by 561
Pólik, I., & Terlaky, T. (2007) · SIAM Review · doi:10.1137/s003614450444614x · Cited by 499
Self-citation
Metadata
- Authors
- Nemirovski, A., Roos, C., & Terlaky, T.
- Venue
- Mathematical Programming
- Published
- 1999-12-01
- Volume
- 86
- Issue
- 3
- Pages
- 463-473
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1970670479
- Cited by
- 168
- References
- 1
- FWCI
- 3.37
- 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: On maximization of quadratic form over intersection of ellipsoids with common center. https://app.cochat.ai/papers/10.1007/s101070050100
- The paper
- Nemirovski, A., Roos, C., & Terlaky, T. (1999). On maximization of quadratic form over intersection of ellipsoids with common center. Mathematical Programming. https://doi.org/10.1007/s101070050100
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.