Convergence Analysis of a Variable Projection Method for Regularized Separable Nonlinear Inverse Problems
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913233671028736 |
|---|---|
| author | Español, Malena I. Jeronimo, Gabriela |
| author_facet | Español, Malena I. Jeronimo, Gabriela |
| contents | Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving large-scale separable nonlinear inverse problems with general-form Tikhonov regularization, the computational demand for computing Jacobians in the Gauss-Newton method becomes very challenging. To mitigate this, iterative methods, specifically LSQR, can be used as inner solvers to compute approximate Jacobians. This article analyzes the impact of these approximate Jacobians within the variable projection method and introduces stopping criteria to ensure convergence. We also present numerical experiments where we apply the proposed method to solve a blind deconvolution problem to illustrate and confirm our theoretical results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_08568 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Convergence Analysis of a Variable Projection Method for Regularized Separable Nonlinear Inverse Problems Español, Malena I. Jeronimo, Gabriela Numerical Analysis 65F22, 65F10, 68W40 Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving large-scale separable nonlinear inverse problems with general-form Tikhonov regularization, the computational demand for computing Jacobians in the Gauss-Newton method becomes very challenging. To mitigate this, iterative methods, specifically LSQR, can be used as inner solvers to compute approximate Jacobians. This article analyzes the impact of these approximate Jacobians within the variable projection method and introduces stopping criteria to ensure convergence. We also present numerical experiments where we apply the proposed method to solve a blind deconvolution problem to illustrate and confirm our theoretical results. |
| title | Convergence Analysis of a Variable Projection Method for Regularized Separable Nonlinear Inverse Problems |
| topic | Numerical Analysis 65F22, 65F10, 68W40 |
| url | https://arxiv.org/abs/2402.08568 |