| 逐次升维的共轭方向法 |
| |
| 引用本文： | 谢泗淮.逐次升维的共轭方向法[J].西南交通大学学报,1992(4):8-12. |
| |
| 作者姓名： | 谢泗淮 |
| |
| 作者单位： | 西南交通大学机械工程一系 |
| |
| 摘 要： | 本文提出一种求函数极值的共轭方向直接法。它构造一组共轭方向需一维求优的次数比原Powell法减少一半,且无共轭方向降维的问题。经多种检验函数测定表明,它比改进Powell法具有程序化容易、速度快、精度高的明显优势。
|
| 关 键 词： | 共轭方向 一维求优 换基 函数极值 |
A New Conjugate Direction Algorithm for Function Minimization |
| |
| Abstract: | A direct method by conjugate direction for function minimization is presented in the paper. The number of one dimensional search is only as half as that in the Powell method. The algorithm has been tested with a large number of test problems. Comparing with the modified Powell method, it requires less computing while gives result with higher precision. |
| |
| Keywords: | conjugate directions linear search changing base for vector set |
| 本文献已被 CNKI 维普 等数据库收录！ |
