论文信息 - Geometrically Constructed Families of Newton's Method for Unconstrained Optimization and Nonlinear Equations

Geometrically Constructed Families of Newton's Method for Unconstrained Optimization and Nonlinear Equations

One-parameter families of Newton's iterative method for the solution of nonlinear equations and its extension to unconstrained optimization problems are presented in the paper. These methods are derived by implementing approximations through a straight line and through a parabolic curve in the vicinity of the root. The presented variants are found to yield better performance than Newton's method, in addition that they overcome its limitations.

[1] C. Kelley. Iterative Methods for Linear and Nonlinear Equations , 1987 .

[2] N. A. Mir,et al. Fourth-order two-step iterative methods for determining multiple zeros of non-linear equations , 2007, Int. J. Comput. Math..

[3] Boris T. Polyak,et al. Newton's method and its use in optimization , 2007, Eur. J. Oper. Res..

[4] J. Traub. Iterative Methods for the Solution of Equations , 1982 .

[5] Jinhai Chen,et al. On new exponential quadratically convergent iterative formulae , 2006, Appl. Math. Comput..

[6] Emin Kahya. A class of exponential quadratically convergent iterative formulae for unconstrained optimization , 2007, Appl. Math. Comput..

[7] A. Ostrowski. Solution of equations in Euclidean and Banach spaces , 1973 .

[8] Sukhjit Singh Dhaliwal,et al. On a class of quadratically convergent iteration formulae , 2005, Appl. Math. Comput..

[9] N. A. Mir,et al. Third-order and fourth-order iterative methods for finding multiple and distinct zeros of non-linear equations , 2007, Appl. Math. Comput..

[10] Vinay Kanwar,et al. Modified families of Newton, Halley and Chebyshev methods , 2007, Appl. Math. Comput..