DeepAI
Log In Sign Up

Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg-Marquardt method

11/11/2020
by   A. Leitao, et al.
0

In this article we propose a novel strategy for choosing the Lagrange multipliers in the Levenberg-Marquardt method for solving ill-posed problems modeled by nonlinear operators acting between Hilbert spaces. Convergence analysis results are established for the proposed method, including: monotonicity of iteration error, geometrical decay of the residual, convergence for exact data, stability and semi-convergence for noisy data. Numerical experiments are presented for an elliptic parameter identification two-dimensional EIT problem. The performance of our strategy is compared with standard implementations of the Levenberg-Marquardt method (using a priori choice of the multipliers).

READ FULL TEXT
11/10/2020

Range-relaxed criteria for choosing the Lagrange multipliers in nonstationary iterated Tikhonov method

In this article we propose a novel nonstationary iterated Tikhonov (NIT)...
07/17/2020

The energy technique for the six-step BDF method

In combination with the Grenander–Szegö theorem, we observe that a relax...
01/26/2021

On level set type methods for elliptic Cauchy problems

Two methods of level set type are proposed for solving the Cauchy proble...
07/14/2022

Stochastic mirror descent method for linear ill-posed problems in Banach spaces

Consider linear ill-posed problems governed by the system A_i x = y_i fo...
11/12/2020

On a family of gradient type projection methods for nonlinear ill-posed problems

We propose and analyze a family of successive projection methods whose s...
11/29/2020

On iterative methods for solving ill-posed problems modeled by PDE's

We investigate the iterative methods proposed by Maz'ya and Kozlov (see ...
10/30/2021

Convergence and Semi-convergence of a class of constrained block iterative methods

In this paper, we analyze the convergence projected non-stationary bloc...