An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) (Q799347)
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: An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) |
scientific article; zbMATH DE number 3874515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) |
scientific article; zbMATH DE number 3874515 |
Statements
An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) (English)
0 references
1983
0 references
leap-frog
0 references
unconstrained minimization
0 references
optimization
0 references
mathematical model
0 references
conjugate gradient algorithm
0 references
comparison
0 references
convergence
0 references
0.8433643579483032
0 references
0.801245927810669
0 references
0.782249927520752
0 references
0.7528157234191895
0 references
0.7520826458930969
0 references
