A new class of memory gradient methods with inexact line searches (Q4675852)
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: A new class of memory gradient methods with inexact line searches |
scientific article; zbMATH DE number 2165971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new class of memory gradient methods with inexact line searches |
scientific article; zbMATH DE number 2165971 |
Statements
A new class of memory gradient methods with inexact line searches (English)
0 references
6 May 2005
0 references
unconstrained optimization
0 references
memory gradient method
0 references
inexact line search
0 references
large scale minimization
0 references
global convergence
0 references
comparison of methods
0 references
Polak-Ribière method
0 references
convergence acceleration
0 references
Fletcher-Reeves method
0 references
algorithms
0 references
numerical experiments
0 references
Armijo's rule
0 references
Wolfe's rule
0 references
0 references
0.9142555594444276
0 references
0.9035701155662536
0 references
0.8958549499511719
0 references
