Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms (Q4348791)
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 1046288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms |
scientific article; zbMATH DE number 1046288 |
Statements
Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms (English)
0 references
1 April 1998
0 references
Kolmogorov and Rényi entropies
0 references
convergent search algorithms
0 references
Lyapunov exponent
0 references
Markov partition property
0 references
convergence criterion
0 references
0.8280925154685974
0 references
0.8275257349014282
0 references
