Squeezing the Arimoto-Blahut algorithm for faster convergence

The Arimoto–Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called ``squeezing’’ strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence.