The Computer Implementation of an Algorithm for Solving Nonlinear Optimization Problems

Article Preview

Abstract:

In this work, we develop a simple yet practical algorithm for solving nonlinear optimization problems by finding a root of a real function with a good local convergence. The algorithm can be easily implemented in software packages for achieving desired convergence orders. For the general-point formula,the order of convergence rate of the presented algorithm is , the unique positive root of the equation .

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1845-1848

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] S. Amat, C. Bermudez, S. Busquier, D. Mestiri, A family of Halley's Chebyshev iterative schemes for non-Frchet differentiable operators, J. Comput. Appl. Math. , 216, 486-493, (2009).

DOI: 10.1016/j.cam.2008.09.005

Google Scholar

[2] I. K. Argyros, Computational theory of iterative methods, Studies in Computational Mathematics , ed. Chui, C.K., Wuytack, L., Elsevier, New York, (2007).

Google Scholar

[3] W. Bi, H. Ren, Q. Wu, Three-step iterative methods with eighth-order convergence for solving nonlinear equations, J. Comput. Appl. Math. , 225, 105-112, (2009).

DOI: 10.1016/j.cam.2008.07.004

Google Scholar

[4] J. Kou, Some variants of Cauchy's method with acceleratedfourth-order convergence, J. Comput. Appl. Math. , 213, 71-78, (2008).

Google Scholar

[5] H. Ren, Q. Wu, W. Bi, New variants of Jarratt's method with sixth-order convergence, Numer. Algorithms , 52, 585-603, (2009).

DOI: 10.1007/s11075-009-9302-3

Google Scholar