检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆大学数理学院,重庆400030
出 处:《计算机技术与发展》2008年第8期108-110,151,共4页Computer Technology and Development
摘 要:填充函数法是一种求解多变量、多极值函数全局最优化的有效方法,这种方法的关键是构造填充函数。为此文中根据文献[1]的思想,考虑优化问题minf(x)The filled function method is an effective approach for finding the global minima of multirnodal and multidimensional functions, and the constructed filled function is vital to the results of optimization. Therefor, by the thought of the literature[1], considering the optimization problem min f(x)x∈R^n, when f( x ) is local Lipschitz continuous function, proposed a modified single - parameter filled function. It is easy to prove that this new filled function can keep filling properties easily relative to conventional filled functiuns , furthermore, its global convergent speed is rapid. The corresponding algorithm was also discussed in this paper. Numerical experience for 4 test functions indicate that the new method is better than the method in the reference.
分 类 号:O221.2[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33