ON THE GLOBAL CONVERGENCE OF CONJUGATE GRADIENT METHODS WITH INEXACT LINESEARCH

被引：0

作者：

刘光辉

韩继业

机构：

[1] Academia sinica

[2] Beijing 100080

[3] Institute of Applied Mathematics

[4] PRC

来源：

Numerical Mathematics A Journal of Chinese Universities(English Series) | 1995年 / 02期

基金：

中国国家自然科学基金;

关键词：

Conjugate gradient method; strong Wolfe line search; global convergence;

D O I：

暂无

中图分类号：

O151 [代数方程论、线性代数];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper we consider the global convergence of any conjugate gradient method of the form d1=-g1,dk+1=-gk+1+βkdk(k≥1)with any βk satisfying sume conditions,and with the strong wolfe line search conditions.Under the convex assumption on the objective function,we preve the descenf property and the global convergence of this method.

引用

页码：147 / 153

页数：7

共 4 条

[1] GLOBAL CONVERGENCE RESULT FOR CONJUGATE-GRADIENT METHODS
HU, YF
STOREY, C
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1991, 71 (02) : 399 - 405
[2] Efficient generalized conjugate gradient algorithms, part 1: Theory[J] . Y. Liu,C. Storey.Journal of Optimization Theory and Applications . 1991 (1)
[3] EFFICIENT HYBRID CONJUGATE-GRADIENT TECHNIQUES
TOUATIAHMED, D
STOREY, C
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1990, 64 (02) : 379 - 397
[4] GLOBALLY CONVERGENT CONJUGATE-GRADIENT ALGORITHMS
SHANNO, DF
[J]. MATHEMATICAL PROGRAMMING, 1985, 33 (01) : 61 - 67

← 1 →