The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Feasible Point Pursuit and Successive Approximation of Non-Convex QCQPs
Open accessAbstract
Quadratically constrained quadratic programs (QCQPs) have a wide range of applications in signal processing and wireless communications. Non-convex QCQPs are NP-hard in general. Existing approaches relax the non-convexity using semi-definite relaxation (SDR) or linearize the non-convex part and solve the resulting convex problem. However, these techniques are seldom successful in even obtaining a feasible solution when the QCQP matrices are indefinite. In this letter, a new feasible point pursuit successive convex approximation (FPP-SCA) algorithm is proposed for non-convex QCQPs. FPP-SCA linearizes the non-convex parts of the problem as conventional SCA does, but adds slack variables to sustain feasibility, and a penalty to ensure slacks are sparingly used. When FPP-SCA is successful in identifying a feasible point of the non-convex QCQP, convergence to a Karush-Kuhn-Tucker (KKT) point is thereafter ensured. Simulations show the effectiveness of our proposed algorithm in obtaining feasible and near-optimal solutions, significantly outperforming existing approaches.
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
Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
Marks, B. R., & Wright, G. P. (1978) · Operations Research · doi:10.1287/opre.26.4.681 · Cited by 985
Cited by
Optimal 3D-Trajectory Design and Resource Allocation for Solar-Powered UAV Communication Systems
Sun, Y., Xu, D., Ng, D. W. K., Dai, L., & Schober, R. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2900630 · Cited by 452
Transmit Waveform/Receive Filter Design for MIMO Radar With Multiple Waveform Constraints
Wu, L., Babu, P., & Palomar, D. P. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2787115 · Cited by 256
Metadata
- Authors
- Mehanna, O., Huang, K., Gopalakrishnan, B., Konar, A., & Sidiropoulos, N. D.
- Venue
- IEEE Signal Processing Letters
- Published
- 2015-07
- Volume
- 22
- Issue
- 7
- Pages
- 804-808
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W1991264581
- Cited by
- 229
- References
- 1
- FWCI
- 22.72
- 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.