摘要
利用改进的粒子群算法求解一类NP-hard且不可微的绝对值方程问题:Ax-|x|=b.该算法是将局部探索能力较强的模式搜索算法和全局开采能力较强的粒子群算法进行有效结合,混合后的算法充分发挥了各自的优点,平衡了局部和全局寻优能力,数值试验显示在求解具有不同类型解的绝对值方程时,误差小,迭代次数少.
Improved particle swarm algorithm was used to solve a class of NP-hard and non-differentiable problem of absolute value equations: Ax-|x| = b. This algorithm effectively combined a strong local exploration ability of pattern search method with a strong global exploitation of the particle swarm algorithm. This hybrid method integrated the good advantages of the two methods and balanced the local and global optimization ability. Numerical experiments showed that this improved method had such advantages as a high precision and less number of iterations for solving absolute value equations with different types of solutions.
作者
封京梅
刘三阳
Feng Jing-mei Liu San-yang(School of Mathematics and Statistics, Xidian University, Xi'an 710126, China Department of Engineering Management, Shaanxi Radio and TV University, Xi'an 710119, China)
出处
《兰州大学学报(自然科学版)》
CAS
CSCD
北大核心
2017年第5期701-705,共5页
Journal of Lanzhou University(Natural Sciences)
基金
国家自然科学基金项目(61373174
11301409)
关键词
绝对值方程
模式搜索法
粒子群算法
absolute value equation
pattern search
particle swarm optimization algorithm