Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests (Q1824994): Difference between revisions
From MaRDI portal
Latest revision as of 11:08, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests |
scientific article |
Statements
Some improved projected quasi-Newton algorithms and their convergence. II: Local convergence rate and numerical tests (English)
0 references
1989
0 references
It is proved that the improved two-sided projected quasi-Newton algorithms for the problem min f(x), \(c(x)=0\), which were presented in part I [ibid. 5, No.1, 33-45 (1989; reviewed above)], are locally one- step or two-step superlinearly convergent. Furthermore, numerical results for some test problems, which are selected from the literature, are given.
0 references
superlinear convergence
0 references
numerical examples
0 references
projected quasi-Newton algorithms
0 references
test problems
0 references
0 references
0 references
0 references
