New results on Hermitian matrix rank-one decomposition
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
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
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Cox, H., Zeskind, R., & Owen, M. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165054 · Cited by 1,681
Pólik, I., & Terlaky, T. (2007) · SIAM Review · doi:10.1137/s003614450444614x · Cited by 499
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Pataki, G. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.2.339 · Cited by 332 · cited 1×
“Theorem 5.1 of [18], or Appendix A of [5], or [ 21 ]).”
BackgroundInfluentialOn Cones of Nonnegative Quadratic Functions
Sturm, J. F., & Zhang, S. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.2.246.14485 · Cited by 319 · cited 13×
“1) can be proven analogously (but then in the real domain), using Proposition 3 of Sturm and Zhang [25].”
BackgroundMethodInfluentialSelf-citationNew Results on Quadratic Minimization
Ye, Y., & Zhang, S. (2003) · SIAM Journal on Optimization · doi:10.1137/s105262340139001x · Cited by 248 · cited 1×
“Most noticeably, it can be used to derive the rank-one optimal solutions for an Semidefinite Program when the number of constraints is small; see [26].”
BackgroundSelf-citationProblems of distance geometry and convex properties of quadratic maps
Barvinok, A. I. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574037 · Cited by 226
Complex Matrix Decomposition and Quadratic Programming
Huang, Y., & Zhang, S. (2007) · Mathematics of Operations Research · doi:10.1287/moor.1070.0268 · Cited by 176 · cited 8×
“In a series of recently papers [2,18,25] we have developed the technique of decomposing a positive semidefinite matrix into the sum of rank-one matrices with some desirable properties.”
BackgroundMethodInfluentialSelf-citation
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-citationConvex 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
Spectrally Constrained MIMO Radar Waveform Design Based on Mutual Information
Tang, B., & Li, J. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2887186 · Cited by 272
Intelligent Reflecting Surface Aided Dual-Function Radar and Communication System
Jiang, Z.-M., Rihan, M., Zhang, P., Huang, L., Deng, Q., Zhang, J., & Mohamed, E. M. (2022) · IEEE Systems Journal · doi:10.1109/jsyst.2021.3057400 · Cited by 264
A Survey of Optimization Approaches for Wireless Physical Layer Security
Wang, D., Bai, B., Zhao, W., & Han, Z. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2883144 · Cited by 263
Joint System Design for Coexistence of MIMO Radar and MIMO Communication
Qian, J., Lops, M., Zheng, L., Wang, X., & He, Z. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2831624 · Cited by 262
Consensus-ADMM for General Quadratically Constrained Quadratic Programming
Huang, K., & Sidiropoulos, N. D. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2593681 · Cited by 242
“d as two inequalities). A QCQP is in general NP-hard, except for some special cases, for example when all the {Ai}m i=1 in “≤” inequality constraints are positive semi-definite [4, §4.4], m is “small” [1,2,14,27], or if the quadratic terms are all homogeneous and {Ai}m i=0 are all Toeplitz [16]. 1 For general non-conve…”
MethodInfluential
Metadata
- Authors
- Ai, W., Huang, Y., & Zhang, S.
- Venue
- Mathematical Programming
- Published
- 2009-08-21
- Volume
- 128
- Issue
- 1-2
- Pages
- 253-283
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2122512744
- Cited by
- 197
- References
- 14
- FWCI
- 7.40
- 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.