| 一维搜索的双切线法和双割线法 |
| |
| 引用本文： | 殷亚明. 一维搜索的双切线法和双割线法[J]. 南京理工大学学报(自然科学版), 1989, 0(4) |
| |
| 作者姓名： | 殷亚明 |
| |
| 作者单位： | 机械制造系 |
| |
| 摘 要： | 本文将函数负梯度的概念应用于一维搜索中,提出了一维搜索的新方法——双切线法和双割线法.特别是双割线法与0.618法和抛物线插值法相比.可使一维搜索的效率明显提高.
|
| 关 键 词： | 最佳搜索[30S] 梯度算法[30S] 最速下降法[30T] |
The Double-cutting Line (DCL) and the Double-secant Line (DSL) Methods of the Unidimensional Search |
| |
| Ying Yaming. The Double-cutting Line (DCL) and the Double-secant Line (DSL) Methods of the Unidimensional Search[J]. Journal of Nanjing University of Science and Technology(Nature Science), 1989, 0(4) |
| |
| Authors: | Ying Yaming |
| |
| Affiliation: | Ying Yaming |
| |
| Abstract: | By the use of the concept of functional negative gradient, this paper states new algorithms or the unidimensional search. the double-cuttingLine(DCL) and the double-secant Line(DSL) methods.Especially, as com-pared with the 0.618 method and the parabolic function-fitting method, the doub-le-secant line method makes the efficiency of the unidimensional search raise obvi-ously. |
| |
| Keywords: | Optimum search Gradient algorithm Steepest descent method |
| 本文献已被 CNKI 等数据库收录！ |
