Range-relaxed Levenberg-Marquardt Kaczmarz method for nonlinear ill-posed problems with strongly convex penalty

Abstract In this manuscript, we propose and analyze a Levenberg-Marquardt-Kaczmarz-$\Theta$ (LMK-$\Theta$) method for obtaining stable reconstructions for systems of nonlinear ill-posed problems between Hilbert spaces. A strongly convex penalty term is incorporated to reconstruct the special features of the sought solution, such as sparsity and discontinuity. The so-called range-relaxed criterion is utilized to determine the appropriate regularization parameter. Convergence analysis for the proposed LMK-$\Theta$ method is provided, including convergence for exact data, stability, and strong convergence for noisy data. Current density impedance imaging (CDII) is presented as a numerical example. We test a geometric phantom and a brain phantom, and the numerical results demonstrate the effectiveness of the proposed LMK-$\Theta$ method. The reconstructions not only achieve good overall accuracy but also successfully recover important structural features of the conductivity, including its discontinuities.

Authors

Institutions

Publication Details

Journal
Inverse Problems
Published
2026-10-30
DOI
https://doi.org/10.1088/1361-6420/aebbe8
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Range-relaxed Levenberg-Marquardt Kaczmarz method for nonlinear ill-posed problems with strongly convex penalty

Min Zhong, Kai Zhu, Wei Wang
1 links
Inverse Problems
Numerical methods in inverse problems
article

Range-relaxed Levenberg-Marquardt Kaczmarz method for nonlinear ill-posed problems with strongly convex penalty

Min Zhong, Kai Zhu, Wei Wang
article en

Abstract

Abstract In this manuscript, we propose and analyze a Levenberg-Marquardt-Kaczmarz-$\Theta$ (LMK-$\Theta$) method for obtaining stable reconstructions for systems of nonlinear ill-posed problems between Hilbert spaces. A strongly convex penalty term is incorporated to reconstruct the special features of the sought solution, such as sparsity and discontinuity. The so-called range-relaxed criterion is utilized to determine the appropriate regularization parameter. Convergence analysis for the proposed LMK-$\Theta$ method is provided, including convergence for exact data, stability, and strong convergence for noisy data. Current density impedance imaging (CDII) is presented as a numerical example. We test a geometric phantom and a brain phantom, and the numerical results demonstrate the effectiveness of the proposed LMK-$\Theta$ method. The reconstructions not only achieve good overall accuracy but also successfully recover important structural features of the conductivity, including its discontinuities.

Inverse Problems
Jiaxing University (CN), Southeast University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 7%
Numerical methods in inverse problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon