Some iterative regularized methods for highly nonlinear least squares problems

    Inga Kangro Info
    Otu Vaarmann Info
DOI: https://doi.org/10.3846/1392-6292.2009.14.179-186

Abstract

This report treats numerical methods for highly nonlinear least squares problems for which procedural and rounding errors are unavoidable, e.g. those arising in the development of various nonlinear system identification techniques based on input‐output representation of the model such as training of artificial neural networks. Let F be a Frechet‐differentiable operator acting between Hilbert spaces H1 and H2 and such that the range of its first derivative is not necessarily closed. For solving the equation F(x) = 0 or minimizing the functional f(x) = ½ ‖F(x)‖2 , x H 1, two‐parameter iterative regularization methods based on the Gauss‐Newton method under certain condition on a test function and the required solution are developed, their computational aspects are discussed and a local convergence theorem is proved.

First published online: 14 Oct 2010

Keywords:

nonlinear least squares, parameter identification, artificial neural networks, iterative regularization, Gauss‐Newton type methods

How to Cite

Kangro, I., & Vaarmann, O. (2009). Some iterative regularized methods for highly nonlinear least squares problems. Mathematical Modelling and Analysis, 14(2), 179-186. https://doi.org/10.3846/1392-6292.2009.14.179-186

Share

Published in Issue
June 30, 2009
Abstract Views
504

View article in other formats

CrossMark check

CrossMark logo

Published

2009-06-30

Issue

Section

Articles

How to Cite

Kangro, I., & Vaarmann, O. (2009). Some iterative regularized methods for highly nonlinear least squares problems. Mathematical Modelling and Analysis, 14(2), 179-186. https://doi.org/10.3846/1392-6292.2009.14.179-186

Share