Wei Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wei Wang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Min Zhong
Department of Mathematics, Southeast University, Nanjing, P. R. China
7 shared publications - Qinian Jin
Mathematical Sciences Institute, Australian National University
6 shared publications Bo Han
4 shared publicationsMin Zhong
3 shared publications- Liang Ding
Northeast Forestry University
2 shared publications Long Li
Department of Mathematics, Northeast Forestry University, China
2 shared publications
Latest Publications
- 11 November 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (11) , 115008
Range-relaxed Levenberg–Marquardt Kaczmarz method for nonlinear ill-posed problems with strongly convex penalty
In this manuscript, we propose and analyze a Levenberg–Marquardt–Kaczmarz- Θ (LMK- Θ ) 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- Θ method is provided, including convergence for exact data, stability, and strong convergence for noisy data. Current density impedance imaging 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- Θ method. The reconstructions not only achieve good overall accuracy but also successfully recover important structural features of the conductivity, including its discontinuities.
- 11 November 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (11) , 115008
Range-relaxed Levenberg–Marquardt Kaczmarz method for nonlinear ill-posed problems with strongly convex penalty
In this manuscript, we propose and analyze a Levenberg–Marquardt–Kaczmarz- Θ (LMK- Θ ) 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- Θ method is provided, including convergence for exact data, stability, and strong convergence for noisy data. Current density impedance imaging 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- Θ method. The reconstructions not only achieve good overall accuracy but also successfully recover important structural features of the conductivity, including its discontinuities.
- 27 October 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (10) , 105005
Convergence rates of inexact Newton–Landweber regularization method in Banach spaces
This paper studies convergence rates of the inexact Newton regularization method for nonlinear ill-posed problems in Banach spaces, where the forward operator maps from a Banach space into a Hilbert space. By employing the Landweber iteration as the inner scheme and terminating the outer Newton iteration by the discrepancy principle, under a benchmark source condition, we establish order-optimal convergence rates of the method via a Lyapunov-type argument. Our analysis allows for nonsmooth regularization functionals and substantial flexibility in the choice of step sizes, including variable step-size strategies. Numerical experiments are provided to validate the theoretical convergence rate results.
- 27 October 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (10) , 105005
Convergence rates of inexact Newton–Landweber regularization method in Banach spaces
This paper studies convergence rates of the inexact Newton regularization method for nonlinear ill-posed problems in Banach spaces, where the forward operator maps from a Banach space into a Hilbert space. By employing the Landweber iteration as the inner scheme and terminating the outer Newton iteration by the discrepancy principle, under a benchmark source condition, we establish order-optimal convergence rates of the method via a Lyapunov-type argument. Our analysis allows for nonsmooth regularization functionals and substantial flexibility in the choice of step sizes, including variable step-size strategies. Numerical experiments are provided to validate the theoretical convergence rate results.
- 30 September 2026
- Published by Springer Nature in Numerische Mathematik
- p. 1-39
Restarted adaptive stochastic Nesterov method with early stopping for ill-posed inverse problems
- 30 September 2026
- Published by Springer Nature in Numerische Mathematik
- p. 1-39
Restarted adaptive stochastic Nesterov method with early stopping for ill-posed inverse problems
- 6 January 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 482
Augmented Lagrangian method for linear inverse problems with repeated measurement data
- 6 January 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 482
Augmented Lagrangian method for linear inverse problems with repeated measurement data
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 22, 178-198
On the existence of a variational regularization parameter under Morozov's discrepancy principle for nonlinear inverse problems
Morozov's discrepancy principle is commonly adopted in Tikhonov regularization for choosing the regularization parameter. Nevertheless, for a general nonlinear inverse problem, the discrepancy $ \|F(x_{\alpha}^{\delta})-y^{\delta}\|_Y $ does not depend continuously on $ \alpha $ and it is questionable whether there exists a regularization parameter $ \alpha $ such that $ \tau_1\delta\leq \|F(x_{\alpha}^{\delta})-y^{\delta}\|_Y\leq \tau_2 \delta $ $ (1\le \tau_1<\tau_2) $. In this paper, we prove the existence of $ \alpha $ under Morozov's discrepancy principle if $ \tau_2\ge (3+2\gamma)\tau_1 $ or $ \tau_{1}\leq \tau_{2}/(3+2\gamma) $, where $ \gamma>0 $ is a parameter in a tangential cone condition for the nonlinear operator $ F $. Furthermore, we present results on the convergence of the regularized solutions under Morozov's discrepancy principle. Numerical results are reported on the efficiency of the proposed approach.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 22, 178-198
On the existence of a variational regularization parameter under Morozov's discrepancy principle for nonlinear inverse problems
Morozov's discrepancy principle is commonly adopted in Tikhonov regularization for choosing the regularization parameter. Nevertheless, for a general nonlinear inverse problem, the discrepancy $ \|F(x_{\alpha}^{\delta})-y^{\delta}\|_Y $ does not depend continuously on $ \alpha $ and it is questionable whether there exists a regularization parameter $ \alpha $ such that $ \tau_1\delta\leq \|F(x_{\alpha}^{\delta})-y^{\delta}\|_Y\leq \tau_2 \delta $ $ (1\le \tau_1<\tau_2) $. In this paper, we prove the existence of $ \alpha $ under Morozov's discrepancy principle if $ \tau_2\ge (3+2\gamma)\tau_1 $ or $ \tau_{1}\leq \tau_{2}/(3+2\gamma) $, where $ \gamma>0 $ is a parameter in a tangential cone condition for the nonlinear operator $ F $. Furthermore, we present results on the convergence of the regularized solutions under Morozov's discrepancy principle. Numerical results are reported on the efficiency of the proposed approach.- 20 August 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (6) , 8195-8224
A Landweber-type iteration with non-smooth convex constraints for ill-posed problems with noisy operators
- 20 August 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (6) , 8195-8224
A Landweber-type iteration with non-smooth convex constraints for ill-posed problems with noisy operators
- Open Access
On existence of a variational regularization parameter under Morozov's discrepancy principle
Morozov's discrepancy principle is commonly adopted in Tikhonov regularization for choosing the regularization parameter. Nevertheless, for a general non-linear inverse problem, the discrepancy $\|F(x_α^δ)-y^δ\|_Y$ does not depend continuously on $α$ and it is questionable whether there exists a regularization parameter $α$ such that $τ_1δ\leq \|F(x_α^δ)-y^δ\|_Y\leq τ_2 δ$ $(1\le τ_1<τ_2)$. In this paper, we prove the existence of $α$ under Morozov's discrepancy principle if $τ_2\ge (3+2γ)τ_1$, where $γ>0$ is a parameter in a tangential cone condition for the nonlinear operator $F$. Furthermore, we present results on the convergence of the regularized solutions under Morozov's discrepancy principle. Numerical results are reported on the efficiency of the proposed approach.Open AccessOn existence of a variational regularization parameter under Morozov's discrepancy principle
Morozov's discrepancy principle is commonly adopted in Tikhonov regularization for choosing the regularization parameter. Nevertheless, for a general non-linear inverse problem, the discrepancy $\|F(x_α^δ)-y^δ\|_Y$ does not depend continuously on $α$ and it is questionable whether there exists a regularization parameter $α$ such that $τ_1δ\leq \|F(x_α^δ)-y^δ\|_Y\leq τ_2 δ$ $(1\le τ_1<τ_2)$. In this paper, we prove the existence of $α$ under Morozov's discrepancy principle if $τ_2\ge (3+2γ)τ_1$, where $γ>0$ is a parameter in a tangential cone condition for the nonlinear operator $F$. Furthermore, we present results on the convergence of the regularized solutions under Morozov's discrepancy principle. Numerical results are reported on the efficiency of the proposed approach. - 7 November 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (12) , 125222
Tikhonov-type regularization for nonlinear inverse problems with multiple repeated measurement data
In this paper, we consider the Tikhonov-type regularization for solving nonlinear inverse problems under the statistical framework that multiple unbiased independent identically distributed measurement data are available. We use the average of these data in the method to reconstruct a solution whose feature is captured by a convex penalty term. Assuming certain conditions concerning the nonlinear operator, we derive the convergence rates where the regularization parameter can be chosen either a priori or a posteriori by the statistical sequential discrepancy principle. We further propose two globally convergent algorithms: the TIGRA- R algorithm for repeated measurements and the Dynamic TIGRA- R algorithm for sequential data. Finally, some numerical experiments illustrate the theoretic analysis and verify the effectiveness of the methods.
- 7 November 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (12) , 125222
Tikhonov-type regularization for nonlinear inverse problems with multiple repeated measurement data
In this paper, we consider the Tikhonov-type regularization for solving nonlinear inverse problems under the statistical framework that multiple unbiased independent identically distributed measurement data are available. We use the average of these data in the method to reconstruct a solution whose feature is captured by a convex penalty term. Assuming certain conditions concerning the nonlinear operator, we derive the convergence rates where the regularization parameter can be chosen either a priori or a posteriori by the statistical sequential discrepancy principle. We further propose two globally convergent algorithms: the TIGRA- R algorithm for repeated measurements and the Dynamic TIGRA- R algorithm for sequential data. Finally, some numerical experiments illustrate the theoretic analysis and verify the effectiveness of the methods.
- Open Access
- 23 June 2023
- Published by IOP Publishing in Inverse Problems
- Vol. 39 (8) , 085005
Dual gradient method for ill-posed problems using multiple repeated measurement data
We consider determining -minimizing solutions of linear ill-posed problems A x = y , where A : X → Y is a bounded linear operator from a Banach space X to a Hilbert space Y and is a proper strongly convex penalty function. Assuming that multiple repeated independent identically distributed unbiased data of y are available, we consider a dual gradient method to reconstruct the -minimizing solution using the average of these data. By terminating the method by either an a priori stopping rule or a statistical variant of the discrepancy principle, we provide the convergence analysis and derive convergence rates when the sought solution satisfies certain variational source conditions. Various numerical results are reported to test the performance of the method.
- 23 June 2023
- Published by IOP Publishing in Inverse Problems
- Vol. 39 (8) , 085005
Open AccessDual gradient method for ill-posed problems using multiple repeated measurement data
We consider determining -minimizing solutions of linear ill-posed problems A x = y , where A : X → Y is a bounded linear operator from a Banach space X to a Hilbert space Y and is a proper strongly convex penalty function. Assuming that multiple repeated independent identically distributed unbiased data of y are available, we consider a dual gradient method to reconstruct the -minimizing solution using the average of these data. By terminating the method by either an a priori stopping rule or a statistical variant of the discrepancy principle, we provide the convergence analysis and derive convergence rates when the sought solution satisfies certain variational source conditions. Various numerical results are reported to test the performance of the method.
- 16 June 2023
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 192, 152-178
A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems
- 16 June 2023
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 192, 152-178
A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems