Guaranteed descent conjugate gradient methods with modified secant condition

Shishun Li; Zhengda Huang

doi:10.3934/jimo.2008.4.739

Article Contents

2008, Volume 4, Issue 4: 739-755. Doi: 10.3934/jimo.2008.4.739

This issue Previous Article Some characterizations and applications on strongly $\alpha$-preinvex and strongly $\alpha$-invex functions Next Article A selection problem for a constrained linear regression model

Guaranteed descent conjugate gradient methods with modified secant condition

Shishun Li^1, and
Zhengda Huang^1,

1.
Department of Mathematics, Zhejiang University, Hangzhou 310027

Received: January 2007

Revised: July 2008

Published: October 2008

Abstract Related Papers Cited by

Abstract

Conjugate gradient methods are typically used to solve large scale unconstrained optimization problems. Recently, Hager and Zhang (2006) proposed two guaranteed descent conjugate gradient methods. In this paper, following Hager and Zhang (2006), we will use the modified secant condition given by Zhang et al.(1999) to present two new descent conjugate gradient methods. An interesting feature of these new methods is that they take both the gradient and function value information. Under some suitable assumptions, global convergence properties for these methods are established. Numerical comparisons with the Hager-Zhang methods are given.

Keywords:

Mathematics Subject Classification: Primary: 65K05, 90C06, 90C30; Secondary: 49D27.

Citation:

Article Metrics

HTML views() PDF downloads(80) Cited by(0)

Guaranteed descent conjugate gradient methods with modified secant condition

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Guaranteed descent conjugate gradient methods with modified secant condition

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content