论文信息 - Quasi-newton algorithms generate identical points - 字舞流文

Quasi-newton algorithms generate identical points

Four theorems are presented that indicate that the sequence of points generated by different members of Broyden's (1967) family are identical, if the linear search routine is accurate.

L. C W. Dixon | L. Dixon

[1] C. G. Broyden. The Convergence of a Class of Double-rank Minimization Algorithms 2. The New Algorithm , 1970 .

[2] H. Y. Huang. Unified approach to quadratically convergent algorithms for function minimization , 1970 .

[3] L. Dixon. Variable metric algorithms: Necessary and sufficient conditions for identical behavior of nonquadratic functions , 1972 .

[4] D. Shanno,et al. Optimal conditioning of quasi-Newton methods , 1970 .

[5] R. Fletcher,et al. A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[6] C. G. Broyden. Quasi-Newton methods and their application to function minimisation , 1967 .

[7] C. G. Broyden. The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .

[8] M. Powell. On the Convergence of the Variable Metric Algorithm , 1971 .

[9] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..