An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms (Q6186565)
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: An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms |
scientific article; zbMATH DE number 7799073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms |
scientific article; zbMATH DE number 7799073 |
Statements
An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms (English)
0 references
2 February 2024
0 references
unconstrained optimization problem
0 references
hybrid conjugate gradient method
0 references
strong Wolfe line search
0 references
sufficient descent condition
0 references
0 references
0 references
0 references
0.9129798412322998
0 references
0.912478804588318
0 references
0.9103721976280212
0 references
0.909032702445984
0 references
0.9032302498817444
0 references
