A generalized adaptive Levenberg–Marquardt method for solving nonlinear ill-posed problems
DOI10.1088/1361-6420/aca789zbMath1505.65291OpenAlexW4311031943MaRDI QIDQ5058282
Haie Long, Guangyu Gao, Bo Han
Publication date: 20 December 2022
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/aca789
asymptotic stabilitynonlinear ill-posed problemsLevenberg-Marquardt methodadaptive strategytwo-point gradient method
Numerical mathematical programming methods (65K05) Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Ill-posed problems for PDEs (35R25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Operator partial differential equations (= PDEs on finite-dimensional spaces for abstract space valued functions) (35R20)
Cites Work
- Unnamed Item
- Unnamed Item
- Levenberg-Marquardt method in Banach spaces with general convex regularization terms
- Approximation of a nondifferentiable nonlinear problem related to MHD equilibria
- Iterative regularization methods for nonlinear ill-posed problems
- On a regularized Levenberg-Marquardt method for solving nonlinear inverse problems
- A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
- Convergence criteria of iterative methods based on Landweber iteration for solving nonlinear problems
- Accelerated homotopy perturbation iteration method for a non-smooth nonlinear ill-posed problem
- A fast two-point gradient method for solving non-smooth nonlinear ill-posed problems
- Bouligand-Landweber iteration for a non-smooth ill-posed problem
- Regularization of inverse problems by two-point gradient methods in Banach spaces
- Convergence rate analysis of a derivative free Landweber iteration for parameter identification in certain elliptic PDEs
- A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
- On projective Landweber–Kaczmarz methods for solving systems of nonlinear ill-posed equations
- Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
- A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
- Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional
- A derivative-free Landweber iteration for parameter identification in certain elliptic PDEs
- Iterative methods for the reconstruction of an inverse potential problem
- A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems
- A projective two-point gradient Kaczmarz iteration for nonlinear ill-posed problems
- Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg–Marquardt method
- Range-relaxed strategy applied to the Levenberg–Marquardt method with uniformly convex penalization term in Banach spaces
- A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
- Bouligand-Levenberg-Marquardt iteration for a non-smooth ill-posed inverse problem
- Convergence analysis of a two-point gradient method for nonlinear ill-posed problems
- A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
- A projected Bouligand–Landweber iteration for non-smooth ill-posed problems
This page was built for publication: A generalized adaptive Levenberg–Marquardt method for solving nonlinear ill-posed problems
