Consensus-ADMM for General Quadratically Constrained Quadratic Programming
Open accessThe DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Nonconvex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing, machine learning, and wireless communications, albeit the general QCQP is NP-hard, and several interesting special cases are NP-hard as well. This paper proposes a new algorithm for general QCQP. The problem is first reformulated in consensus optimization form, to which the alternating direction method of multipliers can be applied. The reformulation is done in such a way that each of the subproblems is a QCQP with only one constraint (QCQP-1), which is efficiently solvable irrespective of (non)convexity. The core components are carefully designed to make the overall algorithm more scalable, including efficient methods for solving QCQP-1, memory efficient implementation, parallel/distributed implementation, and smart initialization. The proposed algorithm is then tested in two applications: multicast beamforming and phase retrieval. The results indicate superior performance over prior state-of-the-art methods.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A practical algorithm for the determination of phase from image and diffraction plane pictures
Gerchberg, R. W. (1972) · Optik · Cited by 4,519
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 · cited 1×
“Quadratically constrained quadratic programming (QCQP) is an optimization problem that minimizes a quadratic function subject to quadractic inequality and equality constraints [1].”
BackgroundGoemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 1×
“Then for each quadratic term, we have that for any point x (0) ∈ C n .”
BackgroundEckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791 · cited 1×
“ADMM was first designed for convex problems, for which it is known to converge under mild conditions [15].”
BackgroundReconstruction of an object from the modulus of its Fourier transform
Fienup, J. R. (1978) · Optics Letters · doi:10.1364/ol.3.000027 · Cited by 1,836 · cited 1×
“There exist many algorithms designed for phase retrieval under specific scenarios, for example, the classical Gerchberg-Saxton algorithm [29] and Fienup’s algorithm [30] were designed for Fourier-based measurements, and have been successfully applied in the phase retrieval community for decades.”
MethodTransmit 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 · cited 8×
“At this point we need to remind the reader that, although the consensus ADMM algorithm we derived for non-convex QCQPs has an appealing form and cheap per-iteration complexity, it is after all a heuristic for what is in general an NP-hard problem.”
BackgroundMethodInfluentialSelf-citation
Cited by
Signal Processing for High-Throughput Satellites: Challenges in New Interference-Limited Scenarios
Perez-Neira, A. I., Vazquez, M. A., Shankar, M. R. B., Maleki, S., & Chatzinotas, S. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2019.2894391 · Cited by 170
“ng P 2 in real multibeam satellite systems. This is the case for the work done in [15], which promotes the use of the consensus alternate direction February 13, 2018 DRAFT 15 of multipliers method of [16] to solve the non-convex QCQP P 2. C. Multiple Gateways Multibeam precoding over multiple GWs consists of transmitt…”
Method
Metadata
- Authors
- Huang, K., & Sidiropoulos, N. D.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-10-15
- Volume
- 64
- Issue
- 20
- Pages
- 5297-5310
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2236834722
- Cited by
- 242
- References
- 32
- FWCI
- 25.94
- Type
- journal article
- Language
- en
- Open access
- green
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.