A new supermemory gradient method with a multi-step curve search rule (Q2885676)
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 6040587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new supermemory gradient method with a multi-step curve search rule |
scientific article; zbMATH DE number 6040587 |
Statements
1 June 2012
0 references
unconstrained optimization
0 references
curve search
0 references
global convergence
0 references
linear convergence rate
0 references
0.9872159
0 references
0.93846744
0 references
0.93846744
0 references
0.93059695
0 references
0.92412174
0 references
0.9214752
0 references
0.9173823
0 references
0.91331875
0 references
A new supermemory gradient method with a multi-step curve search rule (English)
0 references
