arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.2551cond-mat.dis-nncond-mat.other
收藏

二次二元泛函的极小化

On Minimization of a Quadratic Binary Functional

Leonid B. Litinskii

摘要:

研究了一类含有大量二元变量的二次泛函的极小化问题。借助于计算机模拟研究了自旋玻璃矩阵的3种最小化方法。证明了在其他条件相同的情况下,显着优势具有最大动态性(贪婪算法)。的依赖性的结果之间的距离的起始点和基态的调查。确定了局部极小点的分布特征主要取决于该距离。

英文摘要:

The problem of minimization of a quadratic functional depending on great number of binary variables is examined. 3 variants of minimization procedure are studied with the aid of computer simulation for spin-glass matrices. It is shown that under other equal conditions evident superiority has the maximal dynamics (the greedy algorithm). The dependence of the results on a distance between start points and the ground state is investigated. It is determined that the character of distribution of local minima depends on this distance crucially.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑