Conjugate gradient for ill-posed problems: regularization by preconditioning, preconditioning by regularization
Ahmed Chabib, Jean-Francois Witz, Vincent Magnier, Pierre Gosselet
TL;DR
This work advances the use of preconditioned conjugate gradient methods for ill-posed problems by intimately linking preconditioning with Tikhonov regularization through a shared operator M. By leveraging Ritz analysis, it enables costless exploration of multiple regularization weights, informed by L-curve and Picard diagnostics, and supports a posteriori filtering and subspace recycling to accelerate sequences of regularized solves. The methodology is demonstrated on linear data completion via Steklov-Poincaré formulations and on nonlinear optical-flow recovery with matrix-free implementation, achieving robust reconstructions and efficient reuse of spectral information. The results highlight the practical impact of regularization-aware preconditioning for both linear and nonlinear ill-posed problems, with clear paths to extending the approach to inexact preconditioners and broader problem classes.
Abstract
This paper investigates using the conjugate gradient iterative solver for ill-posed problems. We show that preconditioner and Tikhonov-regularization work in conjunction. In particular when they employ the same symmetric positive semi-definite operator, a powerful Ritz analysis allows one to estimate at negligible computational cost the solution for any Tikhonov's weight. This enhanced linear solver is applied to the boundary data completion problem and as the inner solver for the optical flow estimator.
