2011Journal of Jilin University(Science Edition)Requires access

Globally Optimized Spectral Conjugate Gradient Methods under Nonmonotone Conditions

Qingdao Huang

Open publisher page 0 citations

Abstract

A class of spectral conjugate gradient methods was proposed which consider a nonmonotone line search scheme.According to different formulae,we gave a convergence analysis of some numerical experiments.Numerical results show the new method is more efficient in the iterative number.

About this research paper

What this paper is about

A class of spectral conjugate gradient methods was proposed which consider a nonmonotone line search scheme.According to different formulae,we gave a convergence analysis of some numerical experiments.Numerical results show the new method is more efficient in the iterative number.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A class of spectral conjugate gradient methods was proposed which consider a nonmonotone line search scheme.According to different formulae,we gave a convergence analysis of some numerical experiments.Numerical results show the new method is more efficient in the iterative number.

Key concepts: Conjugate gradient method, Derivation of the conjugate gradient method, Conjugate residual method, Nonlinear conjugate gradient method, Biconjugate gradient method, Convergence (economics), Mathematics, Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Globally Optimized Spectral Conjugate Gradient Methods under Nonmonotone Conditions — Research Paper | ScholarLens