2013Unpublished venueRequires access

A Descent Spectral Conjugate Gradient Method for Unconstrained Optimization

Huang Hai

Open publisher page 0 citations

Abstract

A new spectral conjugate gradient method is proposed in this paper.The method is proved to be descensive and globally convergent if the Wolfe line search is used.Preliminary experiments results show that the new method was effective,suitable for solving nonlinear unconstrained optimization problems.

About this research paper

What this paper is about

A new spectral conjugate gradient method is proposed in this paper.The method is proved to be descensive and globally convergent if the Wolfe line search is used.Preliminary experiments results show that the new method was effective,suitable for solving nonlinear unconstrained optimization problems.

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 spectral conjugate gradient method is proposed in this paper.The method is proved to be descensive and globally convergent if the Wolfe line search is used.Preliminary experiments results show that the new method was effective,suitable for solving nonlinear unconstrained optimization problems.

Key concepts: Nonlinear conjugate gradient method, Conjugate gradient method, Derivation of the conjugate gradient method, Gradient descent, Gradient method, Conjugate residual method, Descent (aeronautics), Mathematics

Related papers

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