一种新的全局优化BP网络  

A Global Optimization BP Neural Networks

作　　者：盛立[1] 刘希玉[1] 高明[1] 

机构地区：[1]山东师范大学信息管理学院,山东济南250014

出　　处：《计算机应用研究》2006年第2期211-212,255,共3页Application Research of Computers

基　　金：山东省自然科学基金重大项目(Z2004G02);山东省中青年科学家奖励基金资助项目(03BS003)

摘　　要：将L-M算法与填充函数法相结合,提出一种训练前向网络的混合型全局优化GOBP(G lobalOptim izationBP)算法。L-M算法的收敛速度快,利用它先得到一个局部极小点,然后利用填充函数算法跳出局部最小,得到一个更低的局部极小点,重复计算即可得到全局最优点。经实验验证,该算法收敛速度很快,避免了局部收敛,而且性能稳定。Proposes GOBP（Global Optimization BP） neural networks in which combines the filled function method and Levenberg-Marquardt algorithm for training feed forward neural networks. With the L-M algorithm whose astringency is good, it can find one of local minimal points quickly. Afterwards, the filled function method will be used to find the point that is lower than the minimal point previously found. By repeating these processes, a global minimal point can be obtained at last. Practical examples indicate that the method has a higher accuracy in astringency and works well in avoiding sticking in local minima.

关 键 词：L-M算法 填充函数 全局优化 BP网络 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]