The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Geometric Programming for Communication Systems
Abstract
Recently, Geometric Programming has been applied to study a variety of problems in the analysis and design of communication systems from information theory and queuing theory to signal processing and network protocols. Geometric Programming for Communication Systems begins its comprehensive treatment of the subject by providing an in-depth tutorial on the theory, algorithms, and modeling methods of Geometric Programming. It then gives a systematic survey of the applications of Geometric Programming to the study of communication systems. It collects in one place various published results in this area, which are currently scattered in several books and many research papers, as well as up-to-date unpublished results. Geometric Programming for Communication Systems is intended for researchers and students who wish to have a comprehensive star ting point for understanding the theory and applications of geometric programming in communication systems.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Existence of an equilibrium for a competitive economy
Arrow, K. J., Debreu, G., Debreu, G., & Hildenbrand, W. (2008) · Mathematical Economics · doi:10.1017/ccol052123736x.005 · Cited by 3,041
The rate-distortion function for source coding with side information at the decoder
Wyner, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055508 · Cited by 3,023
How Nature Works: The Science of Self-Organized Criticality
Bak, P., & Weissman, M. (1997) · American Journal of Physics · doi:10.1119/1.18610 · Cited by 2,699
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
A Mathematical Theory of Communications
Shannon, C. E. (1948) · Cited by 2,080
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
Parrilo, P. A. (2000) · doi:10.7907/2k6y-ch43 · Cited by 1,802
A simple distributed autonomous power control algorithm and its convergence
Foschini, G. J., & Miljanic, Z. (1993) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.260747 · Cited by 1,723
TCP Vegas: end to end congestion avoidance on a global Internet
Brakmo, L. S., & Peterson, L. L. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464716 · Cited by 1,699
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
Fundamentals of Statistical and Thermal Physics
Reif, F., & Rice, S. A. (1967) · Physics Today · doi:10.1063/1.3034084 · Cited by 1,423
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Parallel and distributed computation
Bertsekas, D. P., Tsitsiklis, J. N., & Sennikov, A. N. (1989) · Cited by 1,187
Robust Solutions to Least-Squares Problems with Uncertain Data
El Ghaoui, L., & Lebret, H. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896298130 · Cited by 1,076
Rate distortion theory : a mathematical basis for data compression
Berger, T. (1971) · Prentice Hall eBooks · Cited by 953
Robust Solutions to Uncertain Semidefinite Programs
El Ghaoui, L., Oustry, F., & Lebret, H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305717 · Cited by 935
An algorithm for computing the capacity of arbitrary discrete memoryless channels
Arimoto, S. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054753 · Cited by 838
The Mathematics of Internet Congestion Control
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841398 · Cited by 821
Carlson, J. M., & Doyle, J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582499 · Cited by 814
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
Kelly, F. P. (1996) · doi:10.1093/oso/9780198523994.003.0008 · Cited by 704
A duality model of TCP and queue management algorithms
Low, S. H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815297 · Cited by 653
Kandukuri, S., & Boyd, S. (2002) · IEEE Transactions on Wireless Communications · doi:10.1109/7693.975444 · Cited by 642
Robust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
Chiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
Self-citationGeometric Programming : Theory and Application
Duffin, R. J., Peterson, E. L., & Zener, C. M. (1967) · Cited by 604
Elements of Pure Economics; or, The Theory of Social Wealth.
Shackle, G. L. S., Walras, L., & Jaffé, W. (1955) · Economica · doi:10.2307/2551192 · Cited by 587
Optimal design of a CMOS op-amp via geometric programming
Hershenson, M. D., Boyd, S. P., & Lee, T. H. (2001) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.905671 · Cited by 548
Introducing SOSTOOLS: a general purpose sum of squares programming solver
Prajna, S., Papachristodoulou, A., & Parrilo, P. A. (2003) · Proceedings of the 41st IEEE Conference on Decision and Control, 2002. · doi:10.1109/cdc.2002.1184594 · Cited by 545
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels
Lapidoth, A., & Moser, S. M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817449 · Cited by 447
Consensus of Subjective Probabilities: The Pari-Mutuel Method
Eisenberg, E., & Gale, D. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706369 · Cited by 418
Highly Optimized Tolerance: Robustness and Design in Complex Systems
Carlson, J. M., & Doyle, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.2529 · Cited by 330
An exact solution to the transistor sizing problem for CMOS circuits using convex optimization
Sapatnekar, S. S., Rao, V. B., Vaidya, P. M., et al. (1993) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.248073 · Cited by 313
Duality between source coding and channel coding and its extension to the side information case
Pradhan, S. S., Chou, J., & Ramchandran, K. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810622 · Cited by 237
Group Codes for the Gaussian Channel
Slepian, D. (1968) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1968.tb02486.x · Cited by 229
Julian, D., Chiang, M., O'Neill, D., & Boyd, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019292 · Cited by 220
Self-citationOn the converse to the coding theorem for discrete memoryless channels (Corresp.)
Arimoto, S. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055007 · Cited by 207
Geometric Programming: Methods, Computations and Applications
Ecker, J. G. (1980) · SIAM Review · doi:10.1137/1022058 · Cited by 189
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
Ben-Tal, A., Nemirovski, A., & Roos, C. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401392354 · Cited by 189
Global Optimization in Generalized Geometric Programming
(2012) · Springer eBooks · doi:10.1007/springerreference_72312 · Cited by 171
An infeasible interior-point algorithm for solving primal and dual geometric programs
Kortanek, K. O., Xu, X., & Ye, Y. (1997) · Mathematical Programming · doi:10.1007/bf02614382 · Cited by 145
Linearizing Geometric Programs
Duffin, R. J. (1970) · SIAM Review · doi:10.1137/1012043 · Cited by 127
Solution of generalized geometric programs
Avriel, M., Dembo, R. S., & Passy, U. (1975) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620090112 · Cited by 123
Power Laws, Highly Optimized Tolerance, and Generalized Source Coding
Doyle, J. C., & Carlson, J. M. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.5656 · Cited by 118
Control and optimization methods in communication network problems
Anthony Ephremides, B., & Verdú, S. (1989) · IEEE Transactions on Automatic Control · doi:10.1109/9.35806 · Cited by 95
Mathematical Programming Models for Environmental Quality Control
Greenberg, H. J. (1995) · Operations Research · doi:10.1287/opre.43.4.578 · Cited by 63
Global optimization for signomial discrete programming problems in engineering design
Tsai, J., Li, H.-L., & Hu, N.-Z. (2002) · Engineering Optimization · doi:10.1080/03052150215719 · Cited by 43
Optimal allocation of local feedback in multistage amplifiers via geometric programming
Dawson, J. L., Boyd, S., Hershenson, M. D. M., & Lee, T. H. (2001) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.903183 · Cited by 28
Wong, D. (1981) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(81)90018-7 · Cited by 21
An optimization model of communications satellite planning
Dutta, A., & Rama, D. V. (1992) · IEEE Transactions on Communications · doi:10.1109/26.163567 · Cited by 16
Cited by
Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
Shen, K., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2812733 · Cited by 1,935
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationA tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195
Power Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
Self-citationA tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
Metadata
- Authors
- Chiang, M.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2005
- OpenAlex
- W1997988602
- Cited by
- 423
- References
- 63
- FWCI
- 6.86
- Type
- book
- 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.