2017Optimization methods & softwareRequires access

A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method

Min Li

Open publisher page 32 citations

Abstract

In this paper, we propose a new nonlinear conjugate gradient method, which generates search direction close to that of the memoryless BFGS quasi-Newton method. With exact line search, our method will reduce to the standard Hestense-Stiefel nonlinear conjugate gradient method. Moreover, for any line search and constant , the direction of our method satisfies the descent condition . We establish the global convergence for strongly convex objective function with Wolfe line search, and modify this new scheme slightly to guarantee the global convergence for general nonconvex problem. Numerical results show that the proposed method is efficient for the unconstrained problems in the CUTEr library.

About this research paper

What this paper is about

In this paper, we propose a new nonlinear conjugate gradient method, which generates search direction close to that of the memoryless BFGS quasi-Newton method. With exact line search, our method will reduce to the standard Hestense-Stiefel nonlinear conjugate gradient method. Moreover, for any line search and constant , the direction of our method satisfies the descent condition . We establish the global convergence for strongly convex objective function with Wolfe line search, and modify this new scheme slightly to guarantee the global convergence for general nonconvex problem. Numerical results show that the proposed method is efficient for the unconstrained problems in the CUTEr library.

Why it matters

OpenAlex reports 32 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 propose a new nonlinear conjugate gradient method, which generates search direction close to that of the memoryless BFGS quasi-Newton method. With exact line search, our method will reduce to the standard Hestense-Stiefel nonlinear conjugate gradient method. Moreover, for any line search and constant , the direction of our method satisfies the descent condition . We establish the global convergence for strongly convex objective function with Wolfe line search, and modify this new scheme slightly to guarantee the global convergence for general nonconvex problem. Numerical results show that the proposed method is efficient for the unconstrained problems in the CUTEr library.

Key concepts: Broyden–Fletcher–Goldfarb–Shanno algorithm, Line search, Conjugate gradient method, Nonlinear conjugate gradient method, Conjugate residual method, Derivation of the conjugate gradient method, Quasi-Newton method, Gradient descent

Related papers

Back to paper searchBrowse research topicsOriginal source
A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method — Research Paper | ScholarLens