Geometric Programming Duals of Channel Capacity and Rate Distortion

DOI10.1109/TIT.2003.822581zbMath1288.94032MaRDI QIDQ3546709

Mung Chiang, Stephen P. Boyd

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

90C46: Optimality conditions and duality in mathematical programming

94A24: Coding theorems (Shannon theory)

94A34: Rate-distortion theory in information and communication theory

Related Items

Unnamed Item, Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions, Metabolic cost of neuronal information in an empirical stimulus-response model, Computation of channel capacity based on self-concordant functions, Relative entropy optimization and its applications, Tractable approximate robust geometric programming, A tutorial on geometric programming, Capacity of random channels with large alphabets, Stochastic geometric optimization with joint probabilistic constraints, Multi-objective geometric programming problem with \(\epsilon\)-constraint method, A neural network approach to solve geometric programs with joint probabilistic constraints, Copula theory approach to stochastic geometric programming, Worst-case large-deviation asymptotics with application to queueing and information theory, Relative Entropy Relaxations for Signomial Optimization