The DOI matches its Crossref record.
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
Abstract
We consider the problem of minimizing an indefinite quadratic function subject to two quadratic inequality constraints. When the problem is defined over the complex plane we show that strong duality holds and obtain necessary and sufficient optimality conditions. We then develop a connection between the image of the real and complex spaces under a quadratic mapping, which together with the results in the complex case lead to a condition that ensures strong duality in the real setting. Preliminary numerical simulations suggest that for random instances of the extended trust region subproblem, the sufficient condition is satisfied with a high probability. Furthermore, we show that the sufficient condition is always satisfied in two classes of nonconvex quadratic problems. Finally, we discuss an application of our results to robust least squares problems.
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
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
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Secrecy Wireless Information and Power Transfer With MISO Beamforming
Liu, L., Zhang, R., & Chua, K.-C. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2303422 · Cited by 446
Intelligent Reflecting Surface-Assisted Cognitive Radio System
Yuan, J., Liang, Y.-C., Joung, J., Feng, G., & Larsson, E. G. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3033006 · Cited by 286
Robust Cognitive Beamforming With Bounded Channel Uncertainties
Zheng, G., Wong, K.-K., & Ottersten, B. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027462 · Cited by 273
Metadata
- Authors
- Beck, A., & Eldar, Y. C.
- Venue
- SIAM Journal on Optimization
- Published
- 2006-01
- Volume
- 17
- Issue
- 3
- Pages
- 844-860
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2108927308
- Cited by
- 234
- References
- 0
- FWCI
- 9.95
- 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.