Wei Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wei Wang has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Qinian Jin
Mathematical Sciences Institute, Australian National University
2 shared publications - Bo Han
Department of Mathematics, Harbin Institute of Technology, Harbin, China
1 shared publication - Ronny Ramlau
Johannes Kepler University Linz
1 shared publication - Stephan W. Anzengruber
Department of Mathematics, Technische Universität Chemnitz, 09107 Chemnitz, Germany
1 shared publication
Latest Publications
- Open Access
A global minimization algorithm for Tikhonov functionals with sparsity constraints
In this paper we present a globally convergent algorithm for the computation of a minimizer of the Tikhonov functional with sparsity promoting penalty term for nonlinear forward operators in Banach space. The dual TIGRA method uses a gradient descent iteration in the dual space at decreasing values of the regularization parameter $\alpha_j$, where the approximation obtained with $\alpha_j$ serves as the starting value for the dual iteration with parameter $\alpha_{j+1}$. With the discrepancy principle as a global stopping rule the method further yields an automatic parameter choice. We prove convergence of the algorithm under suitable step-size selection and stopping rules and illustrate our theoretic results with numerical experiments for the nonlinear autoconvolution problem.Open AccessA global minimization algorithm for Tikhonov functionals with sparsity constraints
In this paper we present a globally convergent algorithm for the computation of a minimizer of the Tikhonov functional with sparsity promoting penalty term for nonlinear forward operators in Banach space. The dual TIGRA method uses a gradient descent iteration in the dual space at decreasing values of the regularization parameter $\alpha_j$, where the approximation obtained with $\alpha_j$ serves as the starting value for the dual iteration with parameter $\alpha_{j+1}$. With the discrepancy principle as a global stopping rule the method further yields an automatic parameter choice. We prove convergence of the algorithm under suitable step-size selection and stopping rules and illustrate our theoretic results with numerical experiments for the nonlinear autoconvolution problem. - 25 July 2013
- Published by IOP Publishing in Inverse Problems
- Vol. 29 (8) , 085011
Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
The determination of solutions of many inverse problems usually requires a set of measurements which leads to solving systems of ill-posed equations. In this paper, we propose the Landweber iteration of Kaczmarz type with general uniformly convex penalty functional. The method is formulated by using tools from convex analysis. The penalty term is allowed to be non-smooth to include the L1 and total variation-like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. Under reasonable conditions, we establish the convergence of the method. Finally, we present numerical simulations on tomography problems and parameter identification in partial differential equations to indicate the performance.
- 25 July 2013
- Published by IOP Publishing in Inverse Problems
- Vol. 29 (8) , 085011
Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
The determination of solutions of many inverse problems usually requires a set of measurements which leads to solving systems of ill-posed equations. In this paper, we propose the Landweber iteration of Kaczmarz type with general uniformly convex penalty functional. The method is formulated by using tools from convex analysis. The penalty term is allowed to be non-smooth to include the L1 and total variation-like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. Under reasonable conditions, we establish the convergence of the method. Finally, we present numerical simulations on tomography problems and parameter identification in partial differential equations to indicate the performance.
- Open Access
Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
The determination of solutions of many inverse problems usually requires a set of measurements which leads to solving systems of ill-posed equations. In this paper we propose the Landweber iteration of Kaczmarz type with general uniformly convex penalty functional. The method is formulated by using tools from convex analysis. The penalty term is allowed to be non-smooth to include the $L^1$ and total variation (TV) like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. Under reasonable conditions, we establish the convergence of the method. Finally we present numerical simulations on tomography problems and parameter identification in partial differential equations to indicate the performance.Open AccessLandweber iteration of Kaczmarz type with general non-smooth convex penalty functionals
The determination of solutions of many inverse problems usually requires a set of measurements which leads to solving systems of ill-posed equations. In this paper we propose the Landweber iteration of Kaczmarz type with general uniformly convex penalty functional. The method is formulated by using tools from convex analysis. The penalty term is allowed to be non-smooth to include the $L^1$ and total variation (TV) like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. Under reasonable conditions, we establish the convergence of the method. Finally we present numerical simulations on tomography problems and parameter identification in partial differential equations to indicate the performance.