| 一维搜索的收敛性比较 |
| |
| 引用本文： | 张永富.一维搜索的收敛性比较[J].内蒙古民族大学学报(自然科学版),2008,23(2):131-133. |
| |
| 作者姓名： | 张永富 |
| |
| 作者单位： | 内蒙古民族大学,数学与计算机科学学院,内蒙古,通辽,028043 |
| |
| 摘 要： | 精确一维搜索与不精确一维搜索是一维搜索的两种主要形式，为了进一步探讨有关其收敛性的内容，本文将分别运用精确一维搜索中的0．618黄金分割法与不精确一维搜索中的Armijo—Goldstdn搜索法进行比较．
|
| 关 键 词： | 精确一维搜索 不精确一维搜索 收敛性 |
The Constringent Comparison of the One-Dimension Search |
| |
| ZHANG Yong-fu.The Constringent Comparison of the One-Dimension Search[J].Journal of Inner Mongolia University for the Nationalities(Natural Sciences),2008,23(2):131-133. |
| |
| Authors: | ZHANG Yong-fu |
| |
| Institution: | ZHANG Yong- fu (College of Mathemsties and Computer Science, Inner Mongolia University for Nationalities, Tongliao 028043, China) |
| |
| Abstract: | We know two important methods of the one-dimensional search including the exact one-dimensional search and the inexact one- dismensional search. In order to study the eonstringent theories ulteriorly, we will discuss and compare the 0. 618 - Golden Section Rule in the exact one- dimensional search and Armijo-Goldstein rule in the inexact one-dimensional search. |
| |
| Keywords: | The exact one- dimensional search The inexact one- dimensional search Astringency |
| 本文献已被 维普 万方数据 等数据库收录！ |
