| Article ID: | iaor19931292 |
| Country: | United Kingdom |
| Volume: | 19 |
| Issue: | 2 |
| Start Page Number: | 115 |
| End Page Number: | 130 |
| Publication Date: | Apr 1992 |
| Journal: | Engineering Optimization |
| Authors: | Klafszky Emil, Mayer Jnos, Terlaky Tams |
| Keywords: | information theory, programming: geometric |
A duality relationship for the capacity of discrete memoryless channels is studied by means of geometric programming duality theory. A computationally attractive dual approach and a family of algorithms which includes the classic Arimoto-Blahut method is proposed for the computation of capacity.