| 一种全局和声搜索算法求解绝对值方程 |
| |
| 引用本文： | 雍龙泉.一种全局和声搜索算法求解绝对值方程[J].计算机应用研究,2013,30(11):3276-3279. |
| |
| 作者姓名： | 雍龙泉 |
| |
| 作者单位： | 陕西理工学院 数学与计算机科学学院, 陕西 汉中 723001 |
| |
| 基金项目： | 陕西省教育厅科研计划项目（12JK0863） |
| |
| 摘 要： | 绝对值方程Ax-|x|=b是一个不可微的NP-hard问题。在假设矩阵A的奇异值大于1时, 给出了一个求解绝对值方程的全局和声搜索算法。新的和声搜索算法使用了位置更新和小概率变异策略, 实验结果表明, 该算法具有较强的全局搜索能力, 且收敛快、数值稳定性好、参数少等优点, 是求解绝对值方程的一种有效算法。
|
| 关 键 词： | 绝对值方程 全局和声搜索算法 位置更新 小概率变异 |
Global harmony search algorithm for absolute value equation |
| |
| YONG Long-quan.Global harmony search algorithm for absolute value equation[J].Application Research of Computers,2013,30(11):3276-3279. |
| |
| Authors: | YONG Long-quan |
| |
| Affiliation: | School of Mathematics & Computer Science, Shaanxi University of Technology, Hanzhong Shaanxi 723001, China |
| |
| Abstract: | Absolute value equation Ax-|x|=b is a non-differentiable NP-hard problem in its general form. This paper proposed a novel global harmony search algorithm (NGHS) for solving absolute value equations under the condition that all singular values of A exceed one. The NGHS algorithm utilized position updating and mutation strategy with low probability. The numerical experiments show that the method has the advantages of strong ability of exploration, quick convergence, good stability, and few parameters than the other HS-variants algorithms, thus the NGHS method is feasible and effective to absolute value equation. |
| |
| Keywords: | absolute value equation(AVE) global harmony search algorithm position updating mutation strategy with low probability |
|
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
