The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Semidefinite relaxation and nonconvex quadratic optimization
Abstract
In this paper we study the quality of semidefinite relaxation for a global quadratic optimization problem with diagonal quadratic consraints. We prove that such relaxation approximates the exact solution of the problem with relative accuracy mu = (pi/2)-1. We consider some applications of this result.
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
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
Self-citationGoemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
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
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
Metadata
- Authors
- Nesterov, Y.
- Venue
- Optimization Methods and Software
- Publisher
- Informa UK Limited
- Published
- 1998-01
- Volume
- 9
- Issue
- 1-3
- Pages
- 141-160
- ISSN
- 1026-7670 (ISSN-L)
- 1055-6788
- 1029-4937
- OpenAlex
- W2045148236
- Cited by
- 375
- References
- 5
- FWCI
- 9.87
- 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: Semidefinite relaxation and nonconvex quadratic optimization. https://app.cochat.ai/papers/10.1080/10556789808805690
- The paper
- Nesterov, Y. (1998). Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software. https://doi.org/10.1080/10556789808805690
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.
