Abstract
Abstract
The variable projection (VarPro) method is an efficient method to solve separable nonlinear least squares problems. In this paper, we propose a modified VarPro method for solving separable nonlinear least squares problems with general-form Tikhonov regularization. In particular, we apply the Gauss–Newton method to the corresponding reduced problem and investigate its convergence when different approximations of the Jacobian matrix are used. For special cases when computing the generalized singular value decomposition is feasible or a joint spectral decomposition of both forward and regularization operators exists, we provide efficient ways to compute the Jacobians and the solution of the linear subproblems. For large-scale problems, where matrix decompositions are not an option, we compute a reduced Jacobian and apply projection-based iterative methods and generalized Krylov subspace methods to solve the linear subproblems. In all cases, the regularization parameter can be computed automatically at each iteration using generalized cross validation. Several numerical examples highlight the proposed approach’s performance in the quality of the reconstructed image and the reconstructed forward operator, including large-scale two-dimensional imaging problems arising from semi-blind deblurring.
Funder
National Science Foundation
Subject
Applied Mathematics,Computer Science Applications,Mathematical Physics,Signal Processing,Theoretical Computer Science