ScholarLens Back to search
2011•Unpublished venueRequires access

An Improved Algorithm of BFGS and Its Convergence Analysis

Kuilin Chen

Open publisher page 0 citations

Abstract

A class of modified BFGS method based on the new quasi-Newton equation Bk+1sk=y*k is presented in the paper to solve the unconstrained optimization problem.The author proved the global convergence and superlinear convergence of the algorithm under certain assumptions.

About this research paper

What this paper is about

A class of modified BFGS method based on the new quasi-Newton equation Bk+1sk=y*k is presented in the paper to solve the unconstrained optimization problem.The author proved the global convergence and superlinear convergence of the algorithm under certain assumptions.

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 modified BFGS method based on the new quasi-Newton equation Bk+1sk=y*k is presented in the paper to solve the unconstrained optimization problem.The author proved the global convergence and superlinear convergence of the algorithm under certain assumptions.

Key concepts: Broyden–Fletcher–Goldfarb–Shanno algorithm, Convergence (economics), Algorithm, Mathematics, Mathematical optimization, Class (philosophy), Applied mathematics, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An Improved Algorithm of BFGS and Its Convergence Analysis — Research Paper | ScholarLens