浙江大学学报（理学版）2011，Vol.38Issue(2)：144-149,6.DOI:10.3785/j.issn.1008-9497.2011.02.006
一个求解无约束优化问题的填充函数算法
A filled function algorithm for unconstrained global optimization problems
摘要
Abstract
The filled function method is an approach for solving unconstrained global minimization problem. The key of the method is to construct a filled function with good properties. Based on the requirements of definition and basic properties for the filled function, a new filled function with one parameter is proposed for solving unconstrained global optimization problems, which is simple and easy to be calculated. A corresponding filled function algorithm is established. At last, the numerical results are given to show that the new filled function algorithm is effective for solving global optimization problems.关键词
填充函数/无约束优化问题/全局极小解/数值结果分类
数理科学引用本文复制引用
贺素香,陈未来..一个求解无约束优化问题的填充函数算法[J].浙江大学学报（理学版）,2011,38(2):144-149,6.基金项目
国家863计划资助项目(2008AA01Z207) （2008AA01Z207）
中央高校基本科研业务费专项资金资助(2010-Ia-040) （2010-Ia-040）
武汉理工大学自主创新基金资助(20520012). （20520012）
