GLOBAL CONVERCENCE OF THE FLETCHER-REEVES ALGORITHM WITH INEXACT LINESEARCH  

作　　者：LIUGUANGHUI HANJIYE YINHONGXIA 

机构地区：[1]InstituteofAppliedMathematics,AcademiaSinica,Beijing100080 [2]InstituteofAppliedMathematics,AcademisSinica,Beijing100080 [3]DepartmentofMathematicsandAppliedPhysics,BeijingUniversityofAeronauticsandAstronomics,Beijing100083

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》1995年第1期75-82,共8页高校应用数学学报（英文版）（B辑）

摘　　要：In this paper, we investigate the convergence properties of the FletcherReeves algorithm. Under conditions weaker than those in a Paper of M. Al-Baali,we get the global convergence of the Flincher-Reeves algorithm with a low-accuracyinexact linesearch.In this paper, we investigate the convergence properties of the FletcherReeves algorithm. Under conditions weaker than those in a Paper of M. Al-Baali,we get the global convergence of the Flincher-Reeves algorithm with a low-accuracyinexact linesearch.

分 类 号：O229[理学—运筹学与控制论]