论文信息 - A modified secant method for unconstrained minimization

A modified secant method for unconstrained minimization

This paper presents a new globally convergent secant method for unconstrained optimization. The root rate of convergence of this algorithm is superlinear, between 1 and 2, decreasing with dimension of the problem. It is shown that on a class of problems, it is substantially more efficient than a number of other algorithms.

Elijah Polak | E. Polak

[1] R. Brent. Some Efficient Algorithms for Solving Systems of Nonlinear Equations , 1973 .

[2] Allen A. Goldstein,et al. Constructive Real Analysis , 1967 .

[3] L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[4] K. Ritter. A Superlinearly Convergent Method for Unconstrained Minimization , 1970 .

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

[6] Philip Wolfe,et al. The Secant method for simultaneous nonlinear equations , 1959, CACM.

[7] John Grover Barnes,et al. An Algorithm for Solving Non-Linear Equations Based on the Secant Method , 1965, Comput. J..

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