GLOBAL CONVERGENCE RESULT FOR CONJUGATE-GRADIENT METHODS

被引:176
作者
HU, YF
STOREY, C
机构
[1] Department of Mathematical Sciences, Loughborough University of Technology, Loughborough, Leicestershire
关键词
CONJUGATE GRADIENT ALGORITHMS; GLOBAL CONVERGENCE;
D O I
10.1007/BF00939927
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Conjugate gradient optimization algorithms depend on the search directions, s(1) = -g(1), s(k + 1) = -g(k + 1) + beta(k)s(k), k greater-than-or-equal-to 1, with different methods arising from different choices for the scalar beta(k). In this note, conditions are given on beta(k) to ensure global convergence of the resulting algorithms.
引用
收藏
页码:399 / 405
页数:7
相关论文
共 4 条
[1]   DESCENT PROPERTY AND GLOBAL CONVERGENCE OF THE FLETCHER REEVES METHOD WITH INEXACT LINE SEARCH [J].
ALBAALI, M .
IMA JOURNAL OF NUMERICAL ANALYSIS, 1985, 5 (01) :121-124
[2]  
GILBERT JC, 1990, 1268 DOM VOL I NAT R
[3]  
POWELL MJD, 1983, DAMTP1983NA14 U CAMB
[4]   EFFICIENT HYBRID CONJUGATE-GRADIENT TECHNIQUES [J].
TOUATIAHMED, D ;
STOREY, C .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1990, 64 (02) :379-397