2009Advances in MathematicsRequires access

A New Conjugate Gradient Method for Unconstrained Optimization

Zuhua Zhang

Open publisher page 1 citations

Abstract

In this paper we present a new nonlinear cojugate gradient method for unconstraind optimization problems and prove its local convergence.Numerical results show that the new conjugate gradient method is effective and superior to other similar methods.

About this research paper

What this paper is about

In this paper we present a new nonlinear cojugate gradient method for unconstraind optimization problems and prove its local convergence.Numerical results show that the new conjugate gradient method is effective and superior to other similar methods.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

In this paper we present a new nonlinear cojugate gradient method for unconstraind optimization problems and prove its local convergence.Numerical results show that the new conjugate gradient method is effective and superior to other similar methods.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Conjugate Gradient Method for Unconstrained Optimization — Research Paper | ScholarLens