The Arimoto capacity and Sibson capacity, which are based on the Arimoto and Sibson mutual information (MI) of order {\alpha}, respectively, are well-known generalizations of the channel capacity C. In this study, we derive novel alternating optimization algorithms for computing these capacities by providing new max characterizations of the Arimoto MI and Sibson MI. Moreover, we prove that all iterative algorithms for computing these capacities are equivalent under appropriate conditions imposed on their initial distributions

翻译：基于阶数{\alpha}的Arimoto互信息与Sibson互信息分别导出的Arimoto容量和Sibson容量，是信道容量C的著名推广。本研究通过提供Arimoto互信息与Sibson互信息的新最大表征，推导出计算这些容量的新型交替优化算法。此外，我们证明在对其初始分布施加适当条件时，所有用于计算这些容量的迭代算法均相互等价。