| 求解最大团问题的熵正则化方法 |
| |
| 引用本文： | 曹宏举,李兴斯. 求解最大团问题的熵正则化方法[J]. 数学的实践与认识, 2011, 41(6) |
| |
| 作者姓名： | 曹宏举 李兴斯 |
| |
| 作者单位： | 1. 大连外国语学院,软件学院,辽宁,大连,116044
2. 大连理工大学,工业装备结构分析国家重点实验室,辽宁,大连,116024 |
| |
| 摘 要： | 最大团问题是组合优化的一个经典问题.在Motzkin和Straus的二次规划模型基础上,给出一种求解该问题的熵正则化算法.引进熵函数有两个目的,一是将问题的求解纳入信息论方法的框架,二是通过它的引进改善问题的凸性.几个标准考题的计算结果表明,该算法稳定有效.
|
| 关 键 词： | 最大团问题 信息论 熵正则化 凸性 |
Entropic Regularization Approach to Maximum Clique Problem |
| |
| CAO Hong-ju,LI Xing-si. Entropic Regularization Approach to Maximum Clique Problem[J]. Mathematics in Practice and Theory, 2011, 41(6) |
| |
| Authors: | CAO Hong-ju LI Xing-si |
| |
| Abstract: | The maximum clique is a typical problem of combinatorial optimization.Based on the quadratic model given by Motzkin and Straus,we propose an entropic regularization approach to its solution.The introduction of entropy functions are two folds.One is to bring this problem into a framework of information theory;and the other is to improve the convexity of original problem.Computational results for some standard test problems show that our method is stable and effective. |
| |
| Keywords: | maximum clique information theory entropic regularization convexity |
| 本文献已被 万方数据 等数据库收录！ |
|
