The convergence of the Ben-Israel iteration for nonlinear least squares problems
نویسندگان
چکیده
منابع مشابه
The Convergence of the Ben-Israel Iteration for Nonlinear Least Squares Problems
Ben-Israel [ 1 ] proposed a method for the solution of the nonlinear least squares problem m'mx^j^\\F(x)\\2 where F: D C R —► R . This procedure takes the form xk,x = xk — F'(xk) F(xk) where F'(xk) denotes the Moore-Penrose generalized inverse of the Fre'chet derivative of F. We give a general convergence theorem for the method based on Lyapunov stability theory for ordinary difference equation...
متن کاملConvergence of Inner-Iteration GMRES Methods for Least Squares Problems
We develop a general convergence theory for the generalized minimal residual method for least squares problems preconditioned with inner iterations. The inner iterations are performed by stationary iterative methods. We also present theoretical justifications for using specific inner iterations such as the Jacobi and SOR-type methods. The theory is improved particularly in the rankdeficient cas...
متن کاملVariable projection for nonlinear least squares problems
The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...
متن کاملInner-Iteration Krylov Subspace Methods for Least Squares Problems
Stationary inner iterations in combination with Krylov subspace methods are proposed for least squares problems. The inner iterations are efficient in terms of computational work and memory, and serve as powerful preconditioners also for ill-conditioned and rank-deficient least squares problems. Theoretical justifications for using the inner iterations as preconditioners are presented. Numerica...
متن کاملLeast-Squares Policy Iteration
We propose a new approach to reinforcement learning for control problems which combines value-function approximation with linear architectures and approximate policy iteration. This new approach is motivated by the least-squares temporal-difference learning algorithm (LSTD) for prediction problems, which is known for its efficient use of sample experiences compared to pure temporal-difference a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1976
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1976-0416018-3