2005•Journal of Nantong UniversityRequires access

Global Convergence of a Class of Modified BFGS Algorithm in the New Quasi-Newton Equation

Jiafeng Wu

Open publisher page 0 citations

Abstract

A class of modified BFGS algorithm which satisfies the new quasi-Newton equation is proposed in the paper[1],and the global convergence of the algorithm is proved under the condition that the objective function is uniformly convex.In this paper,another proof method of global convergence is given.

About this research paper

What this paper is about

A class of modified BFGS algorithm which satisfies the new quasi-Newton equation is proposed in the paper[1],and the global convergence of the algorithm is proved under the condition that the objective function is uniformly convex.In this paper,another proof method of global convergence is given.

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 algorithm which satisfies the new quasi-Newton equation is proposed in the paper[1],and the global convergence of the algorithm is proved under the condition that the objective function is uniformly convex.In this paper,another proof method of global convergence is given.

Key concepts: Broyden–Fletcher–Goldfarb–Shanno algorithm, Convergence (economics), Mathematics, Function (biology), Class (philosophy), Applied mathematics, Convex function, Quasi-Newton method

Related papers

Back to paper searchBrowse research topicsOriginal source
Global Convergence of a Class of Modified BFGS Algorithm in the New Quasi-Newton Equation — Research Paper | ScholarLens