Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

A simplified generalized Gauss-Newton method for nonlinear ill-posed problems


Authors: Pallavi Mahale and M. Thamban Nair
Journal: Math. Comp. 78 (2009), 171-184
MSC (2000): Primary 65J20
DOI: https://doi.org/10.1090/S0025-5718-08-02149-2
Published electronically: June 10, 2008
MathSciNet review: 2448702
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Iterative regularization methods for nonlinear ill-posed equations of the form $ F(x)= y$, where $ F: D(F) \subset X \to Y$ is an operator between Hilbert spaces $ X $ and $ Y$, usually involve calculation of the Fréchet derivatives of $ F$ at each iterate and at the unknown solution $ x^\dagger$. In this paper, we suggest a modified form of the generalized Gauss-Newton method which requires the Fréchet derivative of $ F$ only at an initial approximation $ x_0$ of the solution $ x^\dagger$. The error analysis for this method is done under a general source condition which also involves the Fréchet derivative only at $ x_0$. The conditions under which the results of this paper hold are weaker than those considered by Kaltenbacher (1998) for an analogous situation for a special case of the source condition.


References [Enhancements On Off] (What's this?)

  • 1. Bakushinskii, A.B. (1992): The problem of the convergence of the iteratively regularised Gauss-Newton method, Comput. Math. Phys., 32, 1353-1359. MR 1185952 (93k:65049)
  • 2. Bakushinskii, A.B. (1995): Iterative methods without saturation for solving degenerate nonlinear operator equations, Dokl. Akad. Nauk, 344: 7-8. MR 1361018
  • 3. Kaltenbacher, Barbara (1998): A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems, Numerische Mathematik, 79, 501-528. MR 1631677 (99f:65091)
  • 4. Blaschke, B., Neubauer, A., Scherzer, O. (1997): On convergence rates for the iteratively regularized Gauss-Newton method, IMA J. Numer. Anal., 17, 421-436. MR 1459331 (98f:65066)
  • 5. Hohage, T. (1997): Logarithmic convergence rates of the iteratively regularized Gauss-Newton method for an inverse potential and an inverse scattering problem, Inverse Problems, 13, 1279-1299. MR 1474369 (98k:65031)
  • 6. Hohage, T. (1999): Iterative methods in inverse obstacle scattering: Regularization theory of linear and nonlinear exponentially ill-posed problems, Ph.D. Thesis, Johannes Kepler University, Linz, Austria.
  • 7. Hohage, T. (2000): Regularization of exponentially ill-posed problems, Numer. Funct. Anal. & Optim., 21, 439-464. MR 1769885 (2001e:65095)
  • 8. Langer, S., Hohage, T. (2007): Convergence analysis of an inexact iteratively regulaized Gauss-Newton method under general source conditions, J. of Inverse & Ill-Posed Problems, 15, 19-35. MR 2337589
  • 9. Mathé, P., Pereverzev, S. (2003): Geometry of ill-posed problems in variable Hilbert scales, Inverse Problems, 19, 789-803. MR 1984890 (2004i:47021)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 65J20

Retrieve articles in all journals with MSC (2000): 65J20


Additional Information

Pallavi Mahale
Affiliation: Department of Mathematics, IIT Madras, Chennai 600036, India
Email: pallavimahale@iitm.ac.in

M. Thamban Nair
Affiliation: Department of Mathematics, IIT Madras, Chennai 600036, India
Email: mtnair@iitm.ac.in

DOI: https://doi.org/10.1090/S0025-5718-08-02149-2
Received by editor(s): July 2, 2007
Received by editor(s) in revised form: January 13, 2008
Published electronically: June 10, 2008
Article copyright: © Copyright 2008 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.

American Mathematical Society