An Efficient Iterative Approach for Large-Scale Separable Nonlinear Inverse Problems

Authors:
Julianne Chung;James G. Nagy
Affiliations:
jmchung@cs.umd.edu;nagy@mathcs.emory.edu
Venue:
SIAM Journal on Scientific Computing
Year:
2010

Citing 13
Cited 3

Optimal choice of a truncation level for the truncated SVD solution of linear first kind integral equations when data are noisy

SIAM Journal on Numerical Analysis
A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations

BIT
Nonlinear total variation based noise removal algorithms

Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion

Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix

ACM Transactions on Mathematical Software (TOMS)
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

ACM Transactions on Mathematical Software (TOMS)
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems

ACM Transactions on Mathematical Software (TOMS)
Computational Methods for Inverse Problems

Computational Methods for Inverse Problems
A Trust-Region Approach to the Regularization of Large-Scale Discrete Forms of Ill-Posed Problems

SIAM Journal on Scientific Computing
Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems

SIAM Journal on Matrix Analysis and Applications
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Deblurring Images: Matrices, Spectra, and Filtering (Fundamentals of Algorithms 3) (Fundamentals of Algorithms)

Deblurring Images: Matrices, Spectra, and Filtering (Fundamentals of Algorithms 3) (Fundamentals of Algorithms)
A Projection-Based Approach to General-Form Tikhonov Regularization

SIAM Journal on Scientific Computing

Kronecker product approximations for image restoration with whole-sample symmetric boundary conditions

Information Sciences: an International Journal
An efficient computational approach for multiframe blind deconvolution

Journal of Computational and Applied Mathematics
Constrained numerical optimization methods for blind deconvolution

Numerical Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an efficient iterative approach to solving separable nonlinear least squares problems that arise in large-scale inverse problems. A variable projection Gauss-Newton method is used to solve the nonlinear least squares problem, and Tikhonov regularization is incorporated using an iterative hybrid scheme. Regularization parameters are chosen automatically using a weighted generalized cross validation method, thus providing a nonlinear solver that requires very little input from the user. Applications from image deblurring and digital tomosynthesis illustrate the effectiveness of the resulting numerical scheme.