The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
Abstract
We consider the NP‐hard problem of finding a minimum norm vector in n‐dimensional real or complex Euclidean space, subject to m concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an $O(m^2)$ approximation in the real case and an $O(m)$ approximation in the complex case. Moreover, we show that these bounds are tight up to a constant factor. When the Hessian of each constraint function is of rank 1 (namely, outer products of some given so‐called steering vectors) and the phase spread of the entries of these steering vectors are bounded away from $\pi/2$, we establish a certain “constant factor” approximation (depending on the phase spread but independent of m and n) for both the SDP relaxation and a convex QP restriction of the original NP‐hard problem. Finally, we consider a related problem of finding a maximum norm vector subject to m convex homogeneous quadratic constraints. We show that an SDP relaxation for this nonconvex QP provides an $O(1/\ln(m))$ approximation, which is analogous to a result of Nemirovski et al. [Math. Program., 86 (1999), pp. 463–473] for the real case.
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
Self-citationFederated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
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
Self-citationFederated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084
“• Reweighted ℓ 2 +SDR [26]: We take the smoothed ℓ p norm for sparsity inducing of x in Step 1, which is solved by the reweighted ℓ 2 -minimization algorithm.”
BackgroundMethodInfluentialOffloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling
Thinh, T. Q., Tang, J., La, Q. D., & Quek, T. Q. S. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2699660 · Cited by 866
Metadata
- Authors
- Luo, Z., Sidiropoulos, N. D., Tseng, P., & Zhang, S.
- Venue
- SIAM Journal on Optimization
- Published
- 2007-01
- Volume
- 18
- Issue
- 1
- Pages
- 1-28
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1978666418
- Cited by
- 225
- References
- 1
- FWCI
- 18.76
- 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: Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. https://app.cochat.ai/papers/10.1137/050642691
- The paper
- Luo, Z., Sidiropoulos, N. D., Tseng, P., & Zhang, S. (2007). Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints. SIAM Journal on Optimization. https://doi.org/10.1137/050642691
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.