2007Journal of Chongqing Institute of TechnologyRequires access

New Trust Region Method for Line Search

Deng Xiao-hong

Open publisher page 2 citations

Abstract

By using a modified BFGS formula,a BFGS-type trust region method with line search technique for unconstrained optimization problems is proposed.Under mild conditions,the global convergence and superlinear convergence of the method are proved.

About this research paper

What this paper is about

By using a modified BFGS formula,a BFGS-type trust region method with line search technique for unconstrained optimization problems is proposed.Under mild conditions,the global convergence and superlinear convergence of the method are proved.

Why it matters

OpenAlex reports 2 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

By using a modified BFGS formula,a BFGS-type trust region method with line search technique for unconstrained optimization problems is proposed.Under mild conditions,the global convergence and superlinear convergence of the method are proved.

Key concepts: Broyden–Fletcher–Goldfarb–Shanno algorithm, Line search, Trust region, Convergence (economics), Mathematical optimization, Line (geometry), Computer science, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
New Trust Region Method for Line Search — Research Paper | ScholarLens