Min Zhong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Min Zhong has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Wei Wang
Jiaxing University
7 shared publications - Qinian Jin
Mathematical Sciences Institute, Australian National University
4 shared publications - Shuai Lu
School of Mathematical Sciences, Fudan University, Shanghai 200433, China
3 shared publications Jin Cheng
School of Mathematical Sciences , Fudan University , 200433; and Shanghai Key Laboratory for Contemporary Applied Mathematics , Shanghai , P. R. China
2 shared publications- Kai Zhu
Southeast University
2 shared publications Bingxue Hou
Jiaxing Univ, Coll Data Sci, Jiaxing 314000, Zhejiang, Peoples R China
1 shared publication
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.
- 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
- 18 February 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (3) , 035007
Solving the acousto-electric tomography by the adaptive Nesterov method of Kaczmarz type
Acousto-electric tomography (AET) is a new hybrid imaging technique. It recovers the conductivity of biological tissue using the internal power density distribution and overcomes the shortcomings of classical electrical impedance tomography, where only the boundary measurement data are applied. In this manuscript, we consider the numerical realization of the AET model. Inspired by the work (Jin 2025 Inverse Problems 41 025005), we develop an adaptive Nesterov method of Kaczmarz type. The combination parameters are no longer chosen by line search, but through adaptive procedures with explicit formulas, which greatly improve the computational efficiency. Furthermore, uniformly convex regularization functionals are incorporated to reconstruct the conductivity with sparsity or discontinuity. The convergence property of the method is rigorously proven under reasonable conditions. Numerical simulations are presented to illustrate the efficiency and feasibility of our proposed method. We emphasize that the proposed method is also applicable for other nonlinear inverse problems with multiple operators.
- 18 February 2025
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (3) , 035007
Solving the acousto-electric tomography by the adaptive Nesterov method of Kaczmarz type
Acousto-electric tomography (AET) is a new hybrid imaging technique. It recovers the conductivity of biological tissue using the internal power density distribution and overcomes the shortcomings of classical electrical impedance tomography, where only the boundary measurement data are applied. In this manuscript, we consider the numerical realization of the AET model. Inspired by the work (Jin 2025 Inverse Problems 41 025005), we develop an adaptive Nesterov method of Kaczmarz type. The combination parameters are no longer chosen by line search, but through adaptive procedures with explicit formulas, which greatly improve the computational efficiency. Furthermore, uniformly convex regularization functionals are incorporated to reconstruct the conductivity with sparsity or discontinuity. The convergence property of the method is rigorously proven under reasonable conditions. Numerical simulations are presented to illustrate the efficiency and feasibility of our proposed method. We emphasize that the proposed method is also applicable for other nonlinear inverse problems with multiple operators.
- 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
Acousto-electric tomography by the convergence of Kaczamrz two-point gradient-$Θ$ method
We study the numerical reconstruction problem in acousto-electric tomography (AET) of recovering the conductivity distribution in a bounded domain from multiple interior power density data. The Two-Point-Gradient-$Θ$ (TPG-$Θ$) in Kaczmarz type is proposed, with a general convex penalty term $Θ$, the algorithm can be utilized in AET problem for recovering sparse and discontinuous conductivity distributions. We establish the convergence of such iterative regularized method. Extensive numerical experiments are presented to illustrate the feasibility and effectiveness of the proposed approach.Open AccessAcousto-electric tomography by the convergence of Kaczamrz two-point gradient-$Θ$ method
We study the numerical reconstruction problem in acousto-electric tomography (AET) of recovering the conductivity distribution in a bounded domain from multiple interior power density data. The Two-Point-Gradient-$Θ$ (TPG-$Θ$) in Kaczmarz type is proposed, with a general convex penalty term $Θ$, the algorithm can be utilized in AET problem for recovering sparse and discontinuous conductivity distributions. We establish the convergence of such iterative regularized method. Extensive numerical experiments are presented to illustrate the feasibility and effectiveness of the proposed approach. - 27 October 2023
- Published by Walter de Gruyter GmbH in Journal of Inverse and Ill-posed Problems
- Vol. 32 (4) , 683-699
Extract the information via multiple repeated observations under randomly distributed noise
Extracting the useful information has been used almost everywhere in many fields of mathematics and applied mathematics. It is a classical ill-posed problem due to the unstable dependence of approximations on small perturbation of the data. The traditional regularization methods depend on the choice of the regularization parameter, which are closely related to an available accurate upper bound of noise level; thus it is not appropriate for the randomly distributed noise with big or unknown variance. In this paper, a purely data driven statistical regularization method is proposed, effectively extracting the information from randomly noisy observations. The rigorous upper bound estimation of confidence interval of the error in norm is established, and some numerical examples are provided to illustrate the effectiveness and computational performance of the method.- 27 October 2023
- Published by Walter de Gruyter GmbH in Journal of Inverse and Ill-posed Problems
- Vol. 32 (4) , 683-699
Extract the information via multiple repeated observations under randomly distributed noise
Extracting the useful information has been used almost everywhere in many fields of mathematics and applied mathematics. It is a classical ill-posed problem due to the unstable dependence of approximations on small perturbation of the data. The traditional regularization methods depend on the choice of the regularization parameter, which are closely related to an available accurate upper bound of noise level; thus it is not appropriate for the randomly distributed noise with big or unknown variance. In this paper, a purely data driven statistical regularization method is proposed, effectively extracting the information from randomly noisy observations. The rigorous upper bound estimation of confidence interval of the error in norm is established, and some numerical examples are provided to illustrate the effectiveness and computational performance of the method.- 4 August 2023
- Published by IOP Publishing in Inverse Problems
- Vol. 39 (9) , 095005
Semi-discrete Tikhonov regularization in RKHS with large randomly distributed noise
The concern of this paper is the numerical solution of the moderately ill-posed first kind integral equations in reproducing kernel Hilbert spaces. Different with previous works in (Krebs et al 2009 J. Inverse Ill-Posed Problems 17 845–69; Zhong et al 2012 Inverse Problems 28 065019), the amount of observation data is large, and corrupted by randomly distributed noise with large variance. In this paper, a purely data driven semi-discrete Tikhonov regularization method is proposed, effectively reconstructing the sought solution. The choice rules of parameters are provided and the rigorous upper bound estimation of confidence interval of the error in L 2 norm is established. Some numerical examples are provided to illustrate the appropriateness of the parameter choice and show the computational performances of the method.
- 4 August 2023
- Published by IOP Publishing in Inverse Problems
- Vol. 39 (9) , 095005
Semi-discrete Tikhonov regularization in RKHS with large randomly distributed noise
The concern of this paper is the numerical solution of the moderately ill-posed first kind integral equations in reproducing kernel Hilbert spaces. Different with previous works in (Krebs et al 2009 J. Inverse Ill-Posed Problems 17 845–69; Zhong et al 2012 Inverse Problems 28 065019), the amount of observation data is large, and corrupted by randomly distributed noise with large variance. In this paper, a purely data driven semi-discrete Tikhonov regularization method is proposed, effectively reconstructing the sought solution. The choice rules of parameters are provided and the rigorous upper bound estimation of confidence interval of the error in L 2 norm is established. Some numerical examples are provided to illustrate the appropriateness of the parameter choice and show the computational performances of the method.
- 23 December 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (1) , 1-30
A Multiscale RBF Method for Severely Ill-Posed Problems on Spheres
- 23 December 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (1) , 1-30
A Multiscale RBF Method for Severely Ill-Posed Problems on Spheres
- 8 March 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 38 (4) , 045007
An asymptotical regularization with convex constraints for inverse problems
We investigate the method of asymptotical regularization for the stable approximate solution of nonlinear ill-posed problems F(x) = y in Hilbert spaces. The method consists of two components, an outer Newton iteration and an inner scheme providing increments by solving a local coupling linearized evolution equations. In addition, a non-smooth uniformly convex functional has been embedded in the evolution equations which is allowed to be non-smooth, including L 1-liked and total variation-like penalty terms. We establish convergence properties of the method, derive stability estimates, and perform the convergence rate under the Hölder continuity of the inverse mapping. Furthermore, based on Runge–Kutta (RK) discretization, different kinds of iteration schemes can be developed for numerical realization. In our numerical experiments, four types iterative scheme, including Landweber type, one-stage explicit, implicit Euler and two-stage RK are presented to illustrate the performance of the proposed method.
- 8 March 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 38 (4) , 045007
An asymptotical regularization with convex constraints for inverse problems
We investigate the method of asymptotical regularization for the stable approximate solution of nonlinear ill-posed problems F(x) = y in Hilbert spaces. The method consists of two components, an outer Newton iteration and an inner scheme providing increments by solving a local coupling linearized evolution equations. In addition, a non-smooth uniformly convex functional has been embedded in the evolution equations which is allowed to be non-smooth, including L 1-liked and total variation-like penalty terms. We establish convergence properties of the method, derive stability estimates, and perform the convergence rate under the Hölder continuity of the inverse mapping. Furthermore, based on Runge–Kutta (RK) discretization, different kinds of iteration schemes can be developed for numerical realization. In our numerical experiments, four types iterative scheme, including Landweber type, one-stage explicit, implicit Euler and two-stage RK are presented to illustrate the performance of the proposed method.