A new class of memory gradient methods with inexact line searches (Q4675852): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/1569395054069008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026257541 / rank | |||
Normal rank | |||
Revision as of 14:26, 19 March 2024
scientific article; zbMATH DE number 2165971
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
