Finite sample behaviour of an ergodically fast line-search algorithm (Q1303781): 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.1023/a:1008757012582 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1584628725 / rank | |||
Normal rank |
Latest revision as of 10:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite sample behaviour of an ergodically fast line-search algorithm |
scientific article |
Statements
Finite sample behaviour of an ergodically fast line-search algorithm (English)
0 references
11 October 2000
0 references
A line search algorithm is presented, based on a study of the ergodic behaviour of the associated dynamic system by a renormalisation of the uncertainty interval at each iteration. It is shown that for functions symmetric with respect to the optimum the algorithm permits to achieve any given precision with significantly less comparisons of function values than the golden section algorithm. For locally smooth functions, numerical simulations are reported that show the robustness of the algorithm with respect to non-symmetry.
0 references
line search algorithm
0 references
ergodic behaviour
0 references
golden section algorithm
0 references
numerical simulations
0 references
robustness
0 references