The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270)
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: The hybrid BFGS-CG method in solving unconstrained optimization problems |
scientific article; zbMATH DE number 7022508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The hybrid BFGS-CG method in solving unconstrained optimization problems |
scientific article; zbMATH DE number 7022508 |
Statements
The hybrid BFGS-CG method in solving unconstrained optimization problems (English)
0 references
14 February 2019
0 references
Summary: In solving large scale problems, the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Hence, a new hybrid method, known as the BFGS-CG method, has been created based on these properties, combining the search direction between conjugate gradient methods and quasi-Newton methods. In comparison to standard BFGS methods and conjugate gradient methods, the BFGS-CG method shows significant improvement in the total number of iterations and CPU time required to solve large scale unconstrained optimization problems. We also prove that the hybrid method is globally convergent.
0 references
0 references
0 references
0 references
0 references