Geometric Programming for Communication Systems

By Mung Chiang. Foundations and Trends in Communications and Information Theory, 2005

487 citations recorded by the source corpus.

Subfields: Computational Mechanics, Control and Systems Engineering, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/25849aa807c41a65024352be09400e2adb3c8e38

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

In Control and Systems Engineering

In Industrial and Manufacturing Engineering

Citations in the corpus

Convergent Propagation Algorithms via Oriented Trees (2007, unknown): “generalized geometric program (GP) [3].”
A tutorial on cross-layer optimization in wireless networks (2006, background): “Such cases include: (a) the so-called high-SINR case where the rate rij of each link (i, j) is a logarithmic function of its SINR [44], [45]; (b) the low-SINR case [46]; (c) single-channel Aloha networks [47]–[49].”
Power Control By Geometric Programming (2007, methodology): “A detailed tutorial of GP and comprehensive survey of its recent applications to communication systems can be found in [ 7 ].”
Euclidean Embedding of Co-occurrence Data (2004, background): “exp functions of an affine function of the variables (Chiang, 2005).”
Theory and Applications of Robust Optimization (2010, background): “ers and transmitters in wireless channels with lognormal fading. For more on applications to communication, particularly the application of geometric programming, we refer the reader to the monograph [58], and the review articles [100, 101]. For applications to coordination schemes and power control”
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks (2008, methodology): “A geometric program is a class of nonlinear optimization problems characterized by objective and constraint functions that have a special form [38], [39].”
An introduction to convex optimization for communications and signal processing (2006, background): “Several important classes of convex problems, such as geometric programming [4], have not been included.”
MIMO Transceiver Design via Majorization Theory (2007, background): “The class of geometric problems is a very important example of nonconvex problems that can be reformulated in convex form by a change of variable [19, 20, 23].”
A tutorial on geometric programming (2007, methodology): “We refer the reader to the tutorial paper [ 27 ] for an extensive discussion on applications of geometric programming in communications and information theory.”
Fractional Programming for Communication Systems—Part I: Power Control and Beamforming (2018, background): “O PTIMIZATION is a key aspect of communication system design [3], [4].”
Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching (2018, background): “g, by approximating the problem as a geometric program [30], essentially smooths out the local optima; but it works only at high SINR.”
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures (2007, background): “A popular example of tackling nonconvexity is the application of geometric programming to communication systems [19].”
Waveform Design for Wireless Power Transfer (2016, methodology): “However, it has been shown in [17] by simulation that such an iterative algorithm often converges to the global optimu m.”