Minimization of extended quadratic functions with inexact line searches (Q1335128)
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: Minimization of extended quadratic functions with inexact line searches |
scientific article; zbMATH DE number 645128
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimization of extended quadratic functions with inexact line searches |
scientific article; zbMATH DE number 645128 |
Statements
Minimization of extended quadratic functions with inexact line searches (English)
0 references
27 September 1994
0 references
For solving an unconstrained minimization problem of a real function the authors present two conjugate gradient algorithms that use modified Heestenes-Stiefel and Fletcher-Reeves formulae, respectively. Numerical comparisons show that some improvement may be obtained with respect to the algorithms with the unmodified formulae.
0 references
unconstrained minimization
0 references
conjugate gradient algorithms
0 references
0.8142014145851135
0 references
0.8083414435386658
0 references
