The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
New Results on Quadratic Minimization
Abstract
In this paper we present several new results on minimizing an indefinite quadratic function under quadratic/linear constraints. The emphasis is placed on the case in which the constraints are two quadratic inequalities. This formulation is termed the extended trust region subproblem in this paper, to distinguish it from the ordinary trust region subproblem, in which the constraint is a single ellipsoid. The computational complexity of the extended trust region subproblem in general is still unknown. In this paper we consider several interesting cases related to this problem and show that for those cases the corresponding semidefinite programming relaxation admits no gap with the true optimal value, and consequently we obtain polynomial-time procedures for solving those special cases of quadratic optimization. For the extended trust region subproblem itself, we introduce a parameterized problem and prove the existence of a trajectory that will lead to an optimal solution. Combining this with a result obtained in the first part of the paper, we propose a polynomial-time solution procedure for the extended trust region subproblem arising from solving nonlinear programs with a single equality constraint.
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-citationOptimal beamforming for two-way multi-antenna relay channel with analogue network coding
Zhang, R., Liang, Y.-C., Chai, C. C., & Cui, S. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090611 · Cited by 560
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Pólik, I., & Terlaky, T. (2007) · SIAM Review · doi:10.1137/s003614450444614x · Cited by 499
On Cooperative Relaying Schemes for Wireless Physical Layer Security
Li, J., Petropulu, A. P., & Weber, S. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2159598 · Cited by 414
Metadata
- Authors
- Ye, Y., & Zhang, S.
- Venue
- SIAM Journal on Optimization
- Published
- 2003-01
- Volume
- 14
- Issue
- 1
- Pages
- 245-267
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2074859470
- Cited by
- 248
- References
- 1
- FWCI
- 2.85
- 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: New Results on Quadratic Minimization. https://app.cochat.ai/papers/10.1137/s105262340139001x
- The paper
- Ye, Y., & Zhang, S. (2003). New Results on Quadratic Minimization. SIAM Journal on Optimization. https://doi.org/10.1137/s105262340139001x
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.