A Novel Iterative Algorithm for Regularized Separable Nonlinear Inverse Problems

The variable projection (VarPro) method is an effective approach for solving separable nonlinear inverse problems. It reformulates the original least squares problem into a reduced nonlinear least squares problem, which is typically solved using the Gauss–Newton (GN) method. However, for certain classes of problems, incorporating general form Tikhonov regularization introduces significant computational challenges, particularly in computing the Jacobian matrix. Although the reformulated problem depends solely on the nonlinear parameters, the linear parameters continue to influence the Jacobian computation, necessitating repeated application of the GN method. To address this, we employ the LSMR algorithm as an efficient inner solver to approximate the Jacobian, applying an appropriate stopping criterion. To balance accuracy and performance, numerical examples demonstrate the effectiveness and practicality of the proposed method.

Authors

Institutions

Publication Details

Journal
International Journal of Computational Methods
Published
2025-09-24
DOI
https://doi.org/10.1142/s0219876225500586
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Iterative Algorithm for Regularized Separable Nonlinear Inverse Problems

Wenquan Xu, Hui Hu
International Journal of Computational Methods
Numerical methods in inverse problems
article

A Novel Iterative Algorithm for Regularized Separable Nonlinear Inverse Problems

Wenquan Xu, Hui Hu
article en

Abstract

The variable projection (VarPro) method is an effective approach for solving separable nonlinear inverse problems. It reformulates the original least squares problem into a reduced nonlinear least squares problem, which is typically solved using the Gauss–Newton (GN) method. However, for certain classes of problems, incorporating general form Tikhonov regularization introduces significant computational challenges, particularly in computing the Jacobian matrix. Although the reformulated problem depends solely on the nonlinear parameters, the linear parameters continue to influence the Jacobian computation, necessitating repeated application of the GN method. To address this, we employ the LSMR algorithm as an efficient inner solver to approximate the Jacobian, applying an appropriate stopping criterion. To balance accuracy and performance, numerical examples demonstrate the effectiveness and practicality of the proposed method.

International Journal of Computational MethodsVol. 23(03)
Hangzhou Normal University (CN), Anqing Normal University (CN)
Openalex Percentile: Top 68%
Numerical methods in inverse problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Novel Iterative Algorithm for Regularized Separable Nonlinear Inverse Problems — Wenquan Xu, Hui Hu · International Journal of Computational Methods (2025) | TGRS Research Map | TGRS