Global convergence properties of the modified BFGS method associating with general line search model (Q1885078)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Global convergence properties of the modified BFGS method associating with general line search model |
scientific article; zbMATH DE number 2111250
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global convergence properties of the modified BFGS method associating with general line search model |
scientific article; zbMATH DE number 2111250 |
Statements
Global convergence properties of the modified BFGS method associating with general line search model (English)
0 references
28 October 2004
0 references
The aim of this article is to design an algorithm for searching the global optimal solution of a non-convex unconstrained optimization problem, by modifying the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method. Under suitable assumptions, global convergence properties of the proposed method are established, which ensure a high rate of convergence, illustrated by numerical experiments.
0 references
non-convex programming
0 references
BFGS-type method
0 references
approximate Hessian
0 references
global convergence
0 references
general line search
0 references
Broyden-Fletcher-Goldfarb-Shanno method
0 references
numerical experiments
0 references
0 references
0 references
0.94440734
0 references
0.9393095
0 references
0.9318582
0 references
0.92230403
0 references
0.9217541
0 references
0.91057783
0 references
0.9075389
0 references
0.9033064
0 references
