Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
Open accessThe DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Abstract
Convex optimization is a powerful tool for resource allocation and signal processing in wireless networks. As the network density is expected to drastically increase in order to accommodate the exponentially growing mobile data traffic, performance optimization problems are entering a new era characterized by a high dimension and/or a large number of constraints, which poses significant design and computational challenges. In this paper, we present a novel two-stage approach to solve large-scale convex optimization problems for dense wireless cooperative networks, which can effectively detect infeasibility and enjoy modeling flexibility. In the proposed approach, the original large-scale convex problem is transformed into a standard cone programming form in the first stage via matrix stuffing, which only needs to copy the problem parameters such as channel state information (CSI) and quality-of-service (QoS) requirements to the prestored structure of the standard form. The capability of yielding infeasibility certificates and enabling parallel computing is achieved by solving the homogeneous self-dual embedding of the primal-dual pair of the standard form. In the solving stage, the operator splitting method, namely, the alternating direction method of multipliers (ADMM), is adopted to solve the large-scale homogeneous self-dual embedding. Compared with second-order methods, ADMM can solve large-scale problems in parallel with modest accuracy within a reasonable amount of time. Simulation results will demonstrate the speedup, scalability, and reliability of the proposed framework compared with the state-of-the-art modeling frameworks and solvers.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“A two-stage framework was provided in [98] for solving general large-scale convex programs with infeasibility detection and scalable computation.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [98]
In the citing paper
“To further speed up the modeling phase and avoid repeatedly parsing and re-generating conic forms, a matrix stuffing technique was presented in [98] to generate the mapping function between the original problem and the conic form in a symbolic way instead of the time-consuming numerical way using CVX.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [98]
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
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
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., & Tufvesson, F. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2178495 · Cited by 4,654
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Scaling up MIMO: Opportunities and challenges with very large arrays
Rusek, F., Persson, D., Lau, B. K., Larsson, E. G., Marzetta, T. L., Edfors, O., Tufvesson, F., Print, P., Rusek, F., Persson, D., et al. (2013) · Cited by 4,089
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
Research works printed but not linked: 1
- 2013, C-RAN: the road towards green RAN, China Mobile
Cited by
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
“management, it is required to design distributed low-complexity large-scale optimization algorithms with light signaling overhead. Although the recent advancements in large-scale convex optimization [111] provide powerful tools for radio resource management, they cannot be directly applied to optimize the computation…”
BackgroundSelf-citationEdge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“To further speed up the modeling phase and avoid repeatedly parsing and re-generating conic forms, a matrix stuffing technique was presented in [98] to generate the mapping function between the original problem and the conic form in a symbolic way instead of the time-consuming numerical way using…”
MethodInfluentialSelf-citationShen, Y., Shi, Y., Zhang, J., & Letaief, K. B. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3036965 · Cited by 367
Self-citationResource Allocation for Ultra-Dense Networks: A Survey, Some Research Issues and Challenges
Teng, Y., Liu, M., Yu, F. R., Leung, V. C. M., Song, M., & Zhang, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2867268 · Cited by 190
LORM: Learning to Optimize for Resource Management in Wireless Networks With Few Training Samples
Shen, Y., Shi, Y., Zhang, J., & Letaief, K. B. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2947591 · Cited by 134
“, WMMSE [18] and conic optimization-based algorithms [19]), user association (e.”
MethodSelf-citation
Metadata
- Authors
- Shi, Y., Zhang, J., O'Donoghue, B., & Letaief, K. B.
- Affiliations
- Hong Kong University of Science and Technology (HK)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2015-09
- Volume
- 63
- Issue
- 18
- Pages
- 4729-4743
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1874281995
- Cited by
- 118
- References
- 51
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 9 · 2023: 8 · 2022: 4 · 2021: 13 · 2020: 10 · 2019: 13 · 2018: 20 · 2017: 16 · 2016: 15 · 2015: 4
- FWCI
- 8.84
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Hong Kong Research Grant Council (16200214)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- large-scale convex optimization, cone programming, infeasibility detection, infeasibility certificates, primal-dual pairs, alternating direction method of multipliers, operator splitting, parallel computing, resource allocation, quality of service constraints, channel state information
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: Large-Scale Convex Optimization for Dense Wireless Cooperative Networks. https://app.cochat.ai/papers/10.1109/tsp.2015.2443731
- The paper
- Shi, Y., Zhang, J., O'Donoghue, B., & Letaief, K. B. (2015). Large-Scale Convex Optimization for Dense Wireless Cooperative Networks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2015.2443731
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.