节点文献

求解箱式约束全局优化问题的新的填充函数(英文)

A New Filled Function for Global Optimization Problems with Box Constraints

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 屈德强吴丹尚有林

【Author】 QU De-qiang;WU Dan;SHANG You-lin;School of Mathematics and Statistics, Henan University of Science and Technology;

【通讯作者】 吴丹;

【机构】 School of Mathematics and Statistics, Henan University of Science and Technology

【摘要】 In this paper, auxiliary function method for global optimization with box constraints is considered. First, a new non-parameter filled function which has the same local minimizers of the objective function is proposed. By the character that having same local minimizers, and these minimizers are all better than the current minimizer of the objective function, it does not need to minimize the objective function except for thefirst iteration in the filled function method. It changes the frame of conventional filled function methods that objective function and filled function are minimized alternately,and can effectively reduce the iterations of the algorithm and accelerate the speed of global optimization. And then the theoretical properties of the filled function are discussed and the corresponding algorithm is established. Finally, numerical experiments are made and comparisons on several test problems are shown which exhibit the feasibility and effectiveness of the algorithm.

【Abstract】 In this paper, auxiliary function method for global optimization with box constraints is considered. First, a new non-parameter filled function which has the same local minimizers of the objective function is proposed. By the character that having same local minimizers, and these minimizers are all better than the current minimizer of the objective function, it does not need to minimize the objective function except for thefirst iteration in the filled function method. It changes the frame of conventional filled function methods that objective function and filled function are minimized alternately,and can effectively reduce the iterations of the algorithm and accelerate the speed of global optimization. And then the theoretical properties of the filled function are discussed and the corresponding algorithm is established. Finally, numerical experiments are made and comparisons on several test problems are shown which exhibit the feasibility and effectiveness of the algorithm.

【基金】 Supported by National Natural Science Foundation of China (Grant No. 11471102, 11701150,12071112);Basic research projects for key scientific research projects in Henan Province (Grant No. 20ZX001)
  • 【文献出处】 数学季刊(英文版) ,Chinese Quarterly Journal of Mathematics , 编辑部邮箱 ,2020年04期
  • 【分类号】O224
  • 【下载频次】41
节点文献中: 

本文链接的文献网络图示:

本文的引文网络