Then, using the inequality of information theory, the paper directly proved that the minimum cross-entropy solution is exactly the dual geometric programming solution.
同时利用信息论中的不等式，直接地证明最小交互熵解就是对偶几何规划解；
Then, using the inequality of information theory, the paper directly proved that the minimum cross-entropy solution is exactly the dual geometric programming solution.
同时利用信息论中的不等式，直接地证明最小交互熵解就是对偶几何规划解；
应用推荐