ScholarLens Back to search
2009•Journal of Xi'an Technological UniversityRequires access

A BFGS-Trust Region Alogorithm for Unconstrained Optimization Problems

WU Hong-mei

Open publisher page 0 citations

Abstract

The author propose a new BFGS trust region algorithm which is based on[1].The advantage of this algorithm is that it has great quality,and global convergence was proved.

About this research paper

What this paper is about

The author propose a new BFGS trust region algorithm which is based on[1].The advantage of this algorithm is that it has great quality,and global convergence was proved.

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

The author propose a new BFGS trust region algorithm which is based on[1].The advantage of this algorithm is that it has great quality,and global convergence was proved.

Key concepts: Broyden–Fletcher–Goldfarb–Shanno algorithm, Trust region, Mathematical optimization, Computer science, Mathematics, Mathematical economics, Exploit, Computer security

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A BFGS-Trust Region Alogorithm for Unconstrained Optimization Problems — Research Paper | ScholarLens