用多目标优化方法映射四个随机变量的熵域
Using multiobjective optimization to map the entropy region of four random variables
摘要:
目前唯一可用的探索由四个随机变量的熵形成的15维熵区域的方法是张和杨从1998年的方法。有人认为,他们的方法相当于解决线性多目标优化问题。Benson外近似算法是求解这类优化问题的基本工具。Benson算法的一个改进版本,它需要解决一个标量线性规划在每次迭代,而不是在以前的版本中的两个或三个。在算法设计过程中,特别注意数值稳定性。所实现的算法用于检查先前关于熵区域的陈述,并获得关于该区域的新信息。实验结果表明,该方法的可行性,用于确定中等规模的极值集,数值不适定的优化问题。随着问题规模的增长,已经观察到Benson算法的两个局限性:一方面标量LP求解器的效率低下,另一方面中间顶点的数量出乎意料地多。
英文摘要:
Presently the only available method of exploring the 15-dimensional entropy region formed by the entropies of four random variables is the one of Zhang and Yeung from 1998. It is argued that their method is equivalent to solving linear multiobjective optimization problems. Benson's outer approximation algorithm is a fundamental tool for solving these optimization problems. An improved version of Benson's algorithm is described which requires solving one scalar linear program in each iteration rather than two or three as in previous versions. During the algorithm design special care was taken for numerical stability. The implemented algorithm was used to check previous statements about the entropy region, and to gain new information on that region. The experimental results demonstrate the viability of the method for determining the extremal set of medium size, numerically ill-posed optimization problems. With growing problem size two limitations of Benson's algorithm have been observed: the inefficiency of the scalar LP solver on one hand and the unexpectedly large number of intermediate vertices on the other.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。