论文信息 - On the accelerating property of an algorithm for function minimization without calculating derivatives

On the accelerating property of an algorithm for function minimization without calculating derivatives

It is shown that the alogrithm of Ref. E1, when converging on a uniformly convex function and when technical condition (13) of Ref. E1 is satisfied, has ann-iterationQ-superlinear rate of convergence and a behaviour which is a precursor of every-iterationQ-superlinearity. This result overrides and corrects main result Theorem 3.1 of Ref. E1.

P. Toint | F. M. Calliee

[1] M. J. D. Powell,et al. An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..

[2] A. Feinstein,et al. Variational Methods for the Study of Nonlinear Operators , 1966 .

[3] Willard I. Zangwill,et al. Minimizing a function without calculating derivatives , 1967, Comput. J..

[4] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[5] Elijah Polak,et al. Computational methods in optimization , 1971 .

[6] Garth P. McCormick,et al. Methods of conjugate directions versus quasi-Newton methods , 1972, Math. Program..

[7] David Mautner Himmelblau,et al. Applied Nonlinear Programming , 1972 .

[8] R. Brent. Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973) , 1975 .

[9] P. Toint,et al. On the uniform nonsingularity of matrices of search directions and the rate of convergence in minimization algorithms , 1977 .