首页 | 本学科首页   官方微博 | 高级检索  
     

一种有效的求解无约束优化问题的共轭方向法
引用本文:李柏林,陈永. 一种有效的求解无约束优化问题的共轭方向法[J]. 计算数学, 1993, 15(3): 303-309
作者姓名:李柏林  陈永
作者单位:西南交通大学(李柏林),西南交通大学(陈永)
基金项目:国家自然科学基金资助项目
摘    要:§1.前言 有些实践中的优化问题可以按无约束来处理,而且大量非常有效的约束优化算法都涉及无约束优化方法,因此,无约束优化方法在实用上是很重要的。 考虑下面的二次目标函数F(X)的无约束优化问题:

关 键 词:无约束优化 共轭方向法 最佳化

AN EFFICIENT CONJUGATE DIRECTION METHOD FOR UNCONSTRAINED FUNCTION MINIMIZATION
Affiliation:Li Bai-lin;Chen Yong Southwest Jiaotong University
Abstract:Based on the properties of conjugate vecrors, a new algorithm for unconstrained functionminimization is developed. The algorithm belongs to the direct search method and is ? conju-gate direction-type method with the property of quadratic termination. Compared with som pre-viouly developed direct search methods including the convensional modified Powell method,the number of one-dimensional search is reduced to the minimum, i.e. only one search in aniterating cycle. In addition, the algorithm presented is simple in calculation and easy incoding, and has the capability of accelerating along the "ridges". The method is compared with three direct search metheds including the modifiedPowell method on many test problems. Numerical results show the efficiency and robustness ofthe new algorithm.
Keywords:
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号