基于单纯形梯度的多起点全局优化算法  

Multistart Global Optimization Algorithm Based on Simplex Gradient

作　　者：刘二涛[1] 刘红卫[1] 刘泽显[1,2] 

机构地区：[1]西安电子科技大学数学与统计学院,西安710126 [2]贺州学院理学院,广西贺州542899

出　　处：《吉林大学学报（理学版）》2016年第6期1282-1288,共7页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:11461021);广西高校科研项目(批准号:2013YB236)

摘　　要：用已知样本点信息构造单纯形梯度及插值函数,提出一种基于单纯形梯度的局部搜索算法.该算法结合有效样本点集Ω的混合选取策略,改进了多起点聚类全局优化算法.结果表明,新算法在效率和稳定性方面均有较大改进,并可有效处理原算法针对"窄谷"类函数估值次数过高的问题.Using the information of known sample points to construct simplex gradient and interpolation function, we proposed a local search algorithm based on the simplex gradient. The algorithm combined the effective sample point set Ω with a hybrid selection strategy, and improved the multistart clustering global optimization algorithm （GLOBAL）. Experimental results show that the new algorithm has great improvement in efficiency and stability, and can effectively deal with the problem of high evaluation of the original algorithm for the ＂narrow valley＂ function.

关 键 词：全局算法 单纯形梯度 无导数 单链接聚类 

分 类 号：O221.2[理学—运筹学与控制论]