Range-relaxed strategy applied to the Levenberg–Marquardt method with uniformly convex penalization term in Banach spaces

DOI10.1088/1361-6420/ac7e68zbMath1495.49011OpenAlexW4285014130MaRDI QIDQ5097564

Eduardo Hafemann, Fábio Margotti

Publication date: 25 August 2022

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/ac7e68

zbMATH Keywords

total variationBanach spacesconvex optimizationLevenberg-Marquardt methodnonlinear inverse problemselectrical impedance tomographyBregman distances

Mathematics Subject Classification ID

Convex programming (90C25) Methods involving semicontinuity and convergence; relaxation (49J45) Existence theories for problems in abstract spaces (49J27) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items (2)

A generalized adaptive Levenberg–Marquardt method for solving nonlinear ill-posed problems ⋮ Sequential Model Correction for Nonlinear Inverse Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Levenberg-Marquardt method in Banach spaces with general convex regularization terms
• Regularization methods in Banach spaces.
• A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
• Newton regularizations for impedance tomography: convergence by local injectivity
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Existence and Uniqueness for Electrode Models for Electric Current Computed Tomography
• On Nonstationary Iterated Tikhonov Methods for Ill-Posed Equations in Banach Spaces
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• On the choice of Lagrange multipliers in the iterated Tikhonov method for linear ill-posed equations in Banach spaces
• Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg–Marquardt method
• Tikhonov-like methods with inexact minimization for solving linear ill-posed problems
• A method for the solution of certain non-linear problems in least squares
• A range-relaxed criteria for choosing the Lagrange multipliers in the iterated Tikhonov Kaczmarz method for solving systems of linear ill-posed equations
• Range-relaxed criteria for choosing the Lagrange multipliers in nonstationary iterated Tikhonov method

This page was built for publication: Range-relaxed strategy applied to the Levenberg–Marquardt method with uniformly convex penalization term in Banach spaces