A derivative free iterative method for solving least squares problems

Authors:
Hongmin Ren;Ioannis K. Argyros;Saïd Hilout
Affiliations:
Department of Information and Electronics, Hangzhou Radio and TV University, Zhejiang, People's Republic of China Hangzhou, 310012;Department of Mathematics Sciences, Cameron University, Lawton, USA 73505;Laboratoire de Mathématiques et Applications, Poitiers University, Futuroscope Chasseneuil Cedex, France 86962
Venue:
Numerical Algorithms
Year:
2011

Citing 4
Cited 0

Convergence of Newton-like methods for singular operator equations using outer inverses

Numerische Mathematik
Testing Unconstrained Optimization Software

ACM Transactions on Mathematical Software (TOMS)
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Computational Theory of Iterative Methods, Volume 15

Computational Theory of Iterative Methods, Volume 15

Quantified Score

Hi-index	0.00

Visualization

Abstract

A derivative free iterative method for approximating a solution of nonlinear least squares problems is studied first in Shakhno and Gnatyshyn (Appl Math Comput 161:253---264, 2005). The radius of convergence is determined as well as usable error estimates. We show that this method is faster than its Secant analogue examined in Shakhno and Gnatyshyn (Appl Math Comput 161:253---264, 2005). Numerical example is also provided in this paper.