Geometric Programming Duals of Channel Capacity and Rate Distortion
From MaRDI portal
Publication:3546709
DOI10.1109/TIT.2003.822581zbMath1288.94032MaRDI QIDQ3546709
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Optimality conditions and duality in mathematical programming (90C46) Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)
Related Items (14)
Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions ⋮ Tractable approximate robust geometric programming ⋮ Metabolic cost of neuronal information in an empirical stimulus-response model ⋮ Capacity of random channels with large alphabets ⋮ Computation of channel capacity based on self-concordant functions ⋮ Copula theory approach to stochastic geometric programming ⋮ Relative entropy optimization and its applications ⋮ Multi-objective geometric programming problem with \(\epsilon\)-constraint method ⋮ Stochastic geometric optimization with joint probabilistic constraints ⋮ Worst-case large-deviation asymptotics with application to queueing and information theory ⋮ Relative Entropy Relaxations for Signomial Optimization ⋮ A tutorial on geometric programming ⋮ Unnamed Item ⋮ A neural network approach to solve geometric programs with joint probabilistic constraints
This page was built for publication: Geometric Programming Duals of Channel Capacity and Rate Distortion
