2001Unpublished venueRequires access

A New Conjugate Gradient Method for Solving Unconstrained Optimization

Ma Chang

Open publisher page 0 citations

Abstract

A new conjugate gradient method for solving unconstrained optimization was proposed.Global convergence result is established with inexact line search.Moreover some numerical results were reported in the paper.

About this research paper

What this paper is about

A new conjugate gradient method for solving unconstrained optimization was proposed.Global convergence result is established with inexact line search.Moreover some numerical results were reported in the paper.

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 new conjugate gradient method for solving unconstrained optimization was proposed.Global convergence result is established with inexact line search.Moreover some numerical results were reported in the paper.

Key concepts: Conjugate gradient method, Nonlinear conjugate gradient method, Gradient method, Derivation of the conjugate gradient method, Conjugate residual method, Mathematical optimization, Conjugate, Computer science

Related papers

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