ScholarLens Back to search
2009•Guangxi kexueRequires access

A Modified BFGS-Trust-Region Algorithm

Zengxin Wei

Open publisher page 0 citations

Abstract

A modified BFGS-trust-region algorithm is proposed and the convergence is studied.This algorithm ensure that the update matix is positive definite and the convergence rate is quadratic.

About this research paper

What this paper is about

A modified BFGS-trust-region algorithm is proposed and the convergence is studied.This algorithm ensure that the update matix is positive definite and the convergence rate is quadratic.

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 modified BFGS-trust-region algorithm is proposed and the convergence is studied.This algorithm ensure that the update matix is positive definite and the convergence rate is quadratic.

Key concepts: Broyden–Fletcher–Goldfarb–Shanno algorithm, Algorithm, Computer science, Trust region, Mathematics, Combinatorics, Mathematical optimization, Telecommunications

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Modified BFGS-Trust-Region Algorithm — Research Paper | ScholarLens