Shanshan Tong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shanshan Tong has a total of 12 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 Bo Han
2 shared publications- Haie Long
MSU-BIT-SMBU Joint Research Center of Applied Mathematics, Shenzhen MSU-BIT University, Shenzhen 518172, People’s Republic of China
2 shared publications Jinping Tang
2 shared publicationsMuyi Liu
2 shared publications- Wei Wang
Jiaxing University
2 shared publications
Latest Publications
- 27 March 2024
- Published by Elsevier in Applied Mathematics Letters
- Vol. 154
Nonstationary asymptotical regularization method with convex constraints for linear ill-posed problems
- 27 March 2024
- Published by Elsevier in Applied Mathematics Letters
- Vol. 154
Nonstationary asymptotical regularization method with convex constraints for linear ill-posed problems
- 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.
- 1 November 2021
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 169, 122-145
Accelerated homotopy perturbation iteration method for a non-smooth nonlinear ill-posed problem
- 1 November 2021
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 169, 122-145
Accelerated homotopy perturbation iteration method for a non-smooth nonlinear ill-posed problem
- 1 September 2020
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (9) , 095012
A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
The averaged Kaczmarz iteration is a hybrid of the Landweber method and Kaczmarz method with easy implementation and increased stability for solving problems with multi nonlinear equations. In this paper, we propose an accelerated averaged Kaczmarz type iterative method by introducing the search direction of homotopy perturbation Kaczmarz and a projective strategy. The new iterate is updated by using an average over the intermediate variables. These variables are obtained by the metric projection of previous iterates onto the stripes which are related to the property of forward operator and noise level. We present the convergence analysis of the proposed method under the similar assumptions of Landweber Kaczmarz method. The numerical experiments on parameter identification problem validate that the proposed method has evident acceleration effect and reconstruction stability.
- 1 September 2020
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (9) , 095012
A projective averaged Kaczmarz iteration for nonlinear ill-posed problems
The averaged Kaczmarz iteration is a hybrid of the Landweber method and Kaczmarz method with easy implementation and increased stability for solving problems with multi nonlinear equations. In this paper, we propose an accelerated averaged Kaczmarz type iterative method by introducing the search direction of homotopy perturbation Kaczmarz and a projective strategy. The new iterate is updated by using an average over the intermediate variables. These variables are obtained by the metric projection of previous iterates onto the stripes which are related to the property of forward operator and noise level. We present the convergence analysis of the proposed method under the similar assumptions of Landweber Kaczmarz method. The numerical experiments on parameter identification problem validate that the proposed method has evident acceleration effect and reconstruction stability.
- 19 November 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 35 (12) , 125005
An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems
Homotopy perturbation iteration is an effective and fast method for solving nonlinear ill-posed problems. It only needs approximately half the computation time of Landweber iteration to reach the similar recovery precision. In this paper, a Nesterov-type accelerated sequential subspace optimization method based on homotopy perturbation iteration is proposed for solving nonlinear inverse problems. The convergence analysis is provided under the general assumptions for iterative regularization methods. The numerical experiments on inverse potential problem indicate that the proposed method dramatically reduces the total number of iterations and time consumption to obtain satisfying approximations, especially for the problems with costly solution of forward calculation.
- 19 November 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 35 (12) , 125005
An accelerated sequential subspace optimization method based on homotopy perturbation iteration for nonlinear ill-posed problems
Homotopy perturbation iteration is an effective and fast method for solving nonlinear ill-posed problems. It only needs approximately half the computation time of Landweber iteration to reach the similar recovery precision. In this paper, a Nesterov-type accelerated sequential subspace optimization method based on homotopy perturbation iteration is proposed for solving nonlinear inverse problems. The convergence analysis is provided under the general assumptions for iterative regularization methods. The numerical experiments on inverse potential problem indicate that the proposed method dramatically reduces the total number of iterations and time consumption to obtain satisfying approximations, especially for the problems with costly solution of forward calculation.
- Open Access
A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the classical assumptions for iterative regularization methods. The design of the two-point gradient method involves the choices of the combination parameters which is systematically discussed. Furthermore, detailed numerical simulations are presented for inverse potential problem, which exhibit that the proposed method leads to a strongly decrease of the iteration numbers and the overall computational time can be significantly reduced.
Open AccessA fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the classical assumptions for iterative regularization methods. The design of the two-point gradient method involves the choices of the combination parameters which is systematically discussed. Furthermore, detailed numerical simulations are presented for inverse potential problem, which exhibit that the proposed method leads to a strongly decrease of the iteration numbers and the overall computational time can be significantly reduced.
- 1 May 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 35 (5) , 055004
A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
In this paper, we first introduce a new Kaczmarz-type method for solving inverse problems that can be written as a system of a finite number of nonlinear equations. The proposed homotopy perturbation Kaczmarz (HPK) iteration is seen as a hybrid method between the homotopy perturbation iteration and the Kaczmarz strategy. Furthermore, an accelerated homotopy perturbation Kaczmarz (AHPK) method is presented based on the general case of Nesterov’s acceleration scheme. Under the classical assumptions for iterative regularization methods, we provide the corresponding convergence analysis for HPK and AHPK, respectively. The HPK iteration is shown to have faster calculation speed and less time consumption than the Landweber–Kaczmarz iteration through some numerical experiments on inverse potential problem. Besides, the significantly reduced computation cost and much better reconstruction quality indicate a remarkable acceleration effect for AHPK.
- 1 May 2019
- Published by IOP Publishing in Inverse Problems
- Vol. 35 (5) , 055004
A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
In this paper, we first introduce a new Kaczmarz-type method for solving inverse problems that can be written as a system of a finite number of nonlinear equations. The proposed homotopy perturbation Kaczmarz (HPK) iteration is seen as a hybrid method between the homotopy perturbation iteration and the Kaczmarz strategy. Furthermore, an accelerated homotopy perturbation Kaczmarz (AHPK) method is presented based on the general case of Nesterov’s acceleration scheme. Under the classical assumptions for iterative regularization methods, we provide the corresponding convergence analysis for HPK and AHPK, respectively. The HPK iteration is shown to have faster calculation speed and less time consumption than the Landweber–Kaczmarz iteration through some numerical experiments on inverse potential problem. Besides, the significantly reduced computation cost and much better reconstruction quality indicate a remarkable acceleration effect for AHPK.
- 14 September 2018
- Published by IOP Publishing in Inverse Problems
- Vol. 34 (11) , 115009
Edge-guided TV p regularization for diffuse optical tomography based on radiative transport equation
An edge-guided TV p regularization is introduced to recover scattering and absorption coefficients simultaneously in optical tomography, which combines the TV p minimizing scheme with an edge-guided strategy. The TV p minimizing scheme consists of a data fidelity term and an -norm of the gradients of underlying optical coefficients. To make the minimization problem numerically tractable, the Huber function is utilized to locally smooth the -norm to obtain a differential objective function. The lagged diffusivity-Newton iteration is applied to find the minimizers of the above Huberized objective function. An edge-guided strategy is inserted into each iteration in the form of a weighted matrix. In addition, a normalizing technique is incorporated into our algorithm to reduce the cross-talk. Compared with regularization, the proposed edge-guided TV p regularization presents superiorities on keeping the shape as well as the size of targets and removing background undulations. Then the proposed method is applied to image the tissue in the presence of a non-scattering or a low-scattering layer. It is shown that our method is capable of imaging the targets in the tissue containing a non-scattering layer using reduced measurements data. Moreover, it holds promise for jointly imaging both targets and the low-scattering layer under a certain noise level.
- 14 September 2018
- Published by IOP Publishing in Inverse Problems
- Vol. 34 (11) , 115009
Edge-guided TV p regularization for diffuse optical tomography based on radiative transport equation
An edge-guided TV p regularization is introduced to recover scattering and absorption coefficients simultaneously in optical tomography, which combines the TV p minimizing scheme with an edge-guided strategy. The TV p minimizing scheme consists of a data fidelity term and an -norm of the gradients of underlying optical coefficients. To make the minimization problem numerically tractable, the Huber function is utilized to locally smooth the -norm to obtain a differential objective function. The lagged diffusivity-Newton iteration is applied to find the minimizers of the above Huberized objective function. An edge-guided strategy is inserted into each iteration in the form of a weighted matrix. In addition, a normalizing technique is incorporated into our algorithm to reduce the cross-talk. Compared with regularization, the proposed edge-guided TV p regularization presents superiorities on keeping the shape as well as the size of targets and removing background undulations. Then the proposed method is applied to image the tissue in the presence of a non-scattering or a low-scattering layer. It is shown that our method is capable of imaging the targets in the tissue containing a non-scattering layer using reduced measurements data. Moreover, it holds promise for jointly imaging both targets and the low-scattering layer under a certain noise level.