Yuxin Xia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuxin Xia has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Bo Han
Department of Mathematics, Harbin Institute of Technology, Harbin, China
4 shared publications - Zhenwu Fu
Department of Mathematics, Harbin Institute of Technology, Harbin, Heilongjiang Province 150001, People’s Republic of China
4 shared publications - Wei Wang
Jiaxing University
2 shared publications - Bangti Jin
Department of Mathematics, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
1 shared publication Bo Han
1 shared publication- Nan Yu1 shared publication
Latest Publications
- 29 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (2) , 1244-1271
Stochastic Gradient Descent for Nonlinear Inverse Problems in Banach Spaces
Stochastic gradient descent (SGD) and its variants are widely used and highly effective optimization methods in machine learning, especially for neural network training. By using a single datum or a small subset of the data, selected randomly at each iteration, SGD scales well to problem size and has been shown to be effective for solving large-scale inverse problems. In this work, we investigate SGD for solving nonlinear inverse problems in Banach spaces through the lens of iterative regularization. Under general assumptions, we prove almost sure convergence of the iterates to the minimum-distance solution and show the regularizing property in expectation under an a priori stopping rule. Further, we establish convergence rates under the conditional stability assumptions for both exact and noisy data. Numerical experiments on Schlieren tomography and electrical impedance tomography are presented to show distinct features of the method.
- 29 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 19 (2) , 1244-1271
Stochastic Gradient Descent for Nonlinear Inverse Problems in Banach Spaces
Stochastic gradient descent (SGD) and its variants are widely used and highly effective optimization methods in machine learning, especially for neural network training. By using a single datum or a small subset of the data, selected randomly at each iteration, SGD scales well to problem size and has been shown to be effective for solving large-scale inverse problems. In this work, we investigate SGD for solving nonlinear inverse problems in Banach spaces through the lens of iterative regularization. Under general assumptions, we prove almost sure convergence of the iterates to the minimum-distance solution and show the regularizing property in expectation under an a priori stopping rule. Further, we establish convergence rates under the conditional stability assumptions for both exact and noisy data. Numerical experiments on Schlieren tomography and electrical impedance tomography are presented to show distinct features of the method.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 20, 1-24
Landweber–Kaczmarz method for inverse problems using multiple repeated measurements
This paper addresses Landweber–Kaczmarz method for solving linear or nonlinear system of inverse problems utilizing a general convex penalty function. Presume that noisy data which contains a deterministic noise level is unknown, and we reconstruct the solutions by averaging measurements obtained through multiple repeated experiments. In order to control the iteration process, our focus is on a new termination rule that relies on a modified version of the discrepancy principle. Theoretically, convergence analysis is presented. The regularization property is established from a statistical perspective. For visualizing the performance of the proposed method, we subsequently apply it to parameter identification problems and photoacoustic/thermoacoustic tomography. Experimental results demonstrate that our method performs well.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Inverse Problems and Imaging
- Vol. 20, 1-24
Landweber–Kaczmarz method for inverse problems using multiple repeated measurements
This paper addresses Landweber–Kaczmarz method for solving linear or nonlinear system of inverse problems utilizing a general convex penalty function. Presume that noisy data which contains a deterministic noise level is unknown, and we reconstruct the solutions by averaging measurements obtained through multiple repeated experiments. In order to control the iteration process, our focus is on a new termination rule that relies on a modified version of the discrepancy principle. Theoretically, convergence analysis is presented. The regularization property is established from a statistical perspective. For visualizing the performance of the proposed method, we subsequently apply it to parameter identification problems and photoacoustic/thermoacoustic tomography. Experimental results demonstrate that our method performs well.
- 1 August 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (8) , 085267
Further study on homotopy perturbation iteration for nonlinear inverse problems
In this paper, we propose two versions of the homotopy perturbation iteration with inexact inner solvers (HP-IIS) for nonlinear inverse problems in both Hilbert and Banach spaces. These approaches involve the integration of an inexact inner solver to estimate the solution of the minimization problem, since solving this problem at each iteration step exactly in general is impossible in practical applications. Based on the ε-subdifferential calculus, we establish the convergence analysis of the proposed methods in both spaces. To validate the theoretical results, we implement the proposed HP-IIS methods through parameter identification inverse problems, auto-convolution inverse problems and Robin coefficient reconstruction problems. Numerical results demonstrate that while the exact solution to minimization problem remains intractable, the HP-IIS methods yield reconstructions that are quantitatively favorable. Furthermore, the proposed HP-IIS methods are still effective in scenarios where the data is corrupted by non-Gaussian noise.
- 1 August 2025
- Published by IOP Publishing in Physica Scripta
- Vol. 100 (8) , 085267
Further study on homotopy perturbation iteration for nonlinear inverse problems
In this paper, we propose two versions of the homotopy perturbation iteration with inexact inner solvers (HP-IIS) for nonlinear inverse problems in both Hilbert and Banach spaces. These approaches involve the integration of an inexact inner solver to estimate the solution of the minimization problem, since solving this problem at each iteration step exactly in general is impossible in practical applications. Based on the ε-subdifferential calculus, we establish the convergence analysis of the proposed methods in both spaces. To validate the theoretical results, we implement the proposed HP-IIS methods through parameter identification inverse problems, auto-convolution inverse problems and Robin coefficient reconstruction problems. Numerical results demonstrate that while the exact solution to minimization problem remains intractable, the HP-IIS methods yield reconstructions that are quantitatively favorable. Furthermore, the proposed HP-IIS methods are still effective in scenarios where the data is corrupted by non-Gaussian noise.
- 30 November 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 39 (1) , 015004
Convergence analysis of inexact Newton–Landweber iteration under Hölder stability
In this paper, we focus on a class of inverse problems with Lipschitz continuous Fréchet derivatives both in Hilbert spaces and Banach spaces. The convergence and convergence rate of the inexact Newton–Landweber method (INLM) for such problems are presented under some assumptions. For the inverse problems in Hilbert spaces, we revisit the convergence result and the convergence rate of the INLM under Lipschitz condition and Hölder stability. Furthermore, the INLM for nonlinear inverse problems in Banach spaces is also considered. By using a Hölder stability corresponding to the Bregman distance, we derive the convergence property and convergence rate of the method.
- 30 November 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 39 (1) , 015004
Convergence analysis of inexact Newton–Landweber iteration under Hölder stability
In this paper, we focus on a class of inverse problems with Lipschitz continuous Fréchet derivatives both in Hilbert spaces and Banach spaces. The convergence and convergence rate of the inexact Newton–Landweber method (INLM) for such problems are presented under some assumptions. For the inverse problems in Hilbert spaces, we revisit the convergence result and the convergence rate of the INLM under Lipschitz condition and Hölder stability. Furthermore, the INLM for nonlinear inverse problems in Banach spaces is also considered. By using a Hölder stability corresponding to the Bregman distance, we derive the convergence property and convergence rate of the method.
- 24 November 2022
- Published by Walter de Gruyter GmbH in Journal of Inverse and Ill-posed Problems
- Vol. 31 (6) , 849-872
A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces
In this paper, we propose and analyze a projected homotopy perturbation method based on sequential Bregman projections for nonlinear inverse problems in Banach spaces. To expedite convergence, the approach uses two search directions given by homotopy perturbation iteration, and the new iteration is calculated as the projection of the current iteration onto the intersection of stripes decided by above directions. The method allows to use -like penalty terms, which is significant to reconstruct sparsity solutions. Under reasonable conditions, we establish the convergence and regularization properties of the method. Finally, two parameter identification problems are presented to indicate the effectiveness of capturing the property of the sparsity solutions and the acceleration effect of the proposed method.- 24 November 2022
- Published by Walter de Gruyter GmbH in Journal of Inverse and Ill-posed Problems
- Vol. 31 (6) , 849-872
A projected homotopy perturbation method for nonlinear inverse problems in Banach spaces
In this paper, we propose and analyze a projected homotopy perturbation method based on sequential Bregman projections for nonlinear inverse problems in Banach spaces. To expedite convergence, the approach uses two search directions given by homotopy perturbation iteration, and the new iteration is calculated as the projection of the current iteration onto the intersection of stripes decided by above directions. The method allows to use -like penalty terms, which is significant to reconstruct sparsity solutions. Under reasonable conditions, we establish the convergence and regularization properties of the method. Finally, two parameter identification problems are presented to indicate the effectiveness of capturing the property of the sparsity solutions and the acceleration effect of the proposed method.- 18 July 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 15 (3) , 1079-1103
A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces
In this paper, we focus on developing a fast Kaczmarz-type method to solve inverse problems that can be written as systems of linear or nonlinear equations in Hilbert spaces. In order to capture the special feature of solutions, we incorporate nonsmooth convex functions into the averaged Kaczmarz iteration, leading to a new Kaczmarz-type method. In addition, aimed at further accelerating our proposed method, the choice of the step size is carefully discussed. Under the similar assumptions of the Kaczmarz-type method, we prove that our method is a convergent regularization method as long as it is terminated by an appropriate stopping rule. Finally, detailed numerical studies are presented for the limited data problem in photoacoustic tomography and the parameter identification problems to show the effectiveness of our method.
- 18 July 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Imaging Sciences
- Vol. 15 (3) , 1079-1103
A Fast Averaged Kaczmarz Iteration with Convex Penalty for Inverse Problems in Hilbert Spaces
In this paper, we focus on developing a fast Kaczmarz-type method to solve inverse problems that can be written as systems of linear or nonlinear equations in Hilbert spaces. In order to capture the special feature of solutions, we incorporate nonsmooth convex functions into the averaged Kaczmarz iteration, leading to a new Kaczmarz-type method. In addition, aimed at further accelerating our proposed method, the choice of the step size is carefully discussed. Under the similar assumptions of the Kaczmarz-type method, we prove that our method is a convergent regularization method as long as it is terminated by an appropriate stopping rule. Finally, detailed numerical studies are presented for the limited data problem in photoacoustic tomography and the parameter identification problems to show the effectiveness of our method.
- 27 August 2021
- Published by IOP Publishing in Inverse Problems
- Vol. 37 (10) , 105003
An accelerated homotopy perturbation iteration for nonlinear ill-posed problems in Banach spaces with uniformly convex penalty
We propose and analyze an accelerated homotopy perturbation iteration based on Nesterov strategy for nonlinear inverse problems in Banach spaces. The method allows to use L 1 -like and total variation-like penalty terms. Therefore, it can cope with the situation where the sought solution is sparse and piece-wise constant. Under some standard assumptions, we show the convergence and regularization properties of the method. Numerical experiments are presented to show the effectiveness as well as the acceleration effect of the proposed method.
- 27 August 2021
- Published by IOP Publishing in Inverse Problems
- Vol. 37 (10) , 105003
An accelerated homotopy perturbation iteration for nonlinear ill-posed problems in Banach spaces with uniformly convex penalty
We propose and analyze an accelerated homotopy perturbation iteration based on Nesterov strategy for nonlinear inverse problems in Banach spaces. The method allows to use L 1 -like and total variation-like penalty terms. Therefore, it can cope with the situation where the sought solution is sparse and piece-wise constant. Under some standard assumptions, we show the convergence and regularization properties of the method. Numerical experiments are presented to show the effectiveness as well as the acceleration effect of the proposed method.