Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5632454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization |
scientific article; zbMATH DE number 5632454 |
Statements
Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (English)
0 references
13 November 2009
0 references
Summary: Two nonlinear conjugate gradient-type methods for solving unconstrained optimization problems are proposed. An attractive property of the methods, is that, without any line search, the generated directions always descend. Under some mild conditions, global convergence results for both methods are established. Preliminary numerical results show that these proposed methods are promising, and competitive with the well-known PRP method.
0 references
large-scale
0 references
comparison of methods
0 references
nonlinear conjugate gradient-type methods
0 references
unconstrained optimization
0 references
global convergence
0 references
numerical results
0 references
PRP method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9277193546295166
0 references
0.9238028526306152
0 references
0.9222631454467772
0 references
