Convergence properties of the Beale-Powell restart algorithm (Q1286637): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Yu-Hong Dai / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ya-Xiang Yuan / rank | |||
Normal rank | |||
Revision as of 19:43, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence properties of the Beale-Powell restart algorithm |
scientific article |
Statements
Convergence properties of the Beale-Powell restart algorithm (English)
0 references
23 August 1999
0 references
The authors give an example showing that the Beale-Powell restart algorithm [cf. \textit{E. M. L. Beale}, Numer. Math. non-lin. Optim., Conf., Univ. Dundee 1971, 39-43 (1972; Zbl 0279.65052) and \textit{M. J. D. Powell}, Math. Program. 12, 241-254 (1977; Zbl 0396.90072)] for large-scale unconstrained optimization may fail to converge. The global convergence of a slightly modified algorithm is proved.
0 references
unconstrained optimization
0 references
conjugate gradient
0 references
linear search
0 references
Beale-Powell restart algorithm
0 references
large-scale unconstrained optimization
0 references
global convergence
0 references
