New Trust Region Method for Line Search
Deng Xiao-hong
Abstract
Deng Xiao-hong
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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