ScholarLens Back to search
2009•Journal of Hechi UniversityRequires access

The Quasi-Newton Method for Nonconvex Unconstrained Optimization Problems Under a Modified Generalized DFP Method

Meng Yang

Open publisher page 0 citations

Abstract

A modified under DFP method generalized quasi-Newton method is presented for solving nonconvex unconstrained optimizationproblems.Under Goldstein line search,it is proved that the proposed method is global convergent.

About this research paper

What this paper is about

A modified under DFP method generalized quasi-Newton method is presented for solving nonconvex unconstrained optimizationproblems.Under Goldstein line search,it is proved that the proposed method is global convergent.

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 under DFP method generalized quasi-Newton method is presented for solving nonconvex unconstrained optimizationproblems.Under Goldstein line search,it is proved that the proposed method is global convergent.

Key concepts: Mathematics, Mathematical optimization, Applied mathematics, Newton's method, Quasi-Newton method, Calculus (dental), Computer science, Nonlinear system

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Quasi-Newton Method for Nonconvex Unconstrained Optimization Problems Under a Modified Generalized DFP Method — Research Paper | ScholarLens