The residual method for regularizing ill-posed problems

DOI10.1016/J.AMC.2011.08.009zbMATH Open1247.65076DBLPjournals/amc/GrasmairHS11arXiv0905.1187OpenAlexW2060993709WikidataQ41100922 ScholiaQ41100922MaRDI QIDQ425458FDOQ425458

Markus Grasmair, Otmar Scherzer, Markus Haltmeier

Publication date: 8 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: Although the emph{residual method}, or emph{constrained regularization}, is frequently used in applications, a detailed study of its properties is still missing. This sharply contrasts the progress of the theory of Tikhonov regularization, where a series of new results for regularization in Banach spaces has been published in the recent years. The present paper intends to bridge the gap between the existing theories as far as possible. We develop a stability and convergence theory for the residual method in general topological spaces. In addition, we prove convergence rates in terms of (generalized) Bregman distances, which can also be applied to non-convex regularization functionals. We provide three examples that show the applicability of our theory. The first example is the regularized solution of linear operator equations on $L^p$-spaces, where we show that the results of Tikhonov regularization generalize unchanged to the residual method. As a second example, we consider the problem of density estimation from a finite number of sampling points, using the Wasserstein distance as a fidelity term and an entropy measure as regularization term. It is shown that the densities obtained in this way depend continuously on the location of the sampled points and that the underlying density can be recovered as the number of sampling points tends to infinity. Finally, we apply our theory to compressed sensing. Here, we show the well-posedness of the method and derive convergence rates both for convex and non-convex regularization under rather weak conditions.

Full work available at URL: https://arxiv.org/abs/0905.1187

Recommendations

• On the connection between the generalized discrepancy method and the generalized discrepancy principle for non-linear ill-posed problems
• scientific article; zbMATH DE number 3926111
• A convergence criterion for approximations in the residual method for linear ill-posed problems
• scientific article; zbMATH DE number 484354
• Regularization Methods for Ill-Posed Problems

zbMATH Keywords

convergencesignal processingsparsityTikhonov regularizationstabilityBanach spacecompressed sensingimage processingill-posed problems\(L_p\) spaceresidual method

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Title not available (Why is that?)
• Stable recovery of sparse overcomplete representations in the presence of noise
• Just relax: convex programming methods for identifying sparse signals in noise
• Stable signal recovery from incomplete and inaccurate measurements
• A class of Wasserstein metrics for probability distributions
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse and Redundant Representations
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces
• Necessary and sufficient conditions for linear convergence of ℓ1-regularization
• Strong convergence results related to strict convexity
• Title not available (Why is that?)
• Modern methods in the calculus of variations. \(L^p\) spaces
• Recovery of Exact Sparse Representations in the Presence of Bounded Noise
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Introduction to Banach Space Theory
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Convergence rates of convex variational regularization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regularization of ill-posed problems in Banach spaces: convergence rates
• Variational methods in imaging
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Title not available (Why is that?)
• Approximate source conditions for nonlinear ill-posed problems—chances and limitations
• Title not available (Why is that?)
• Analysis of bounded variation penalty methods for ill-posed problems
• Title not available (Why is that?)
• A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
• Title not available (Why is that?)
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Error estimates for non-quadratic regularization and the relation to enhancement
• The restricted isometry property and its implications for compressed sensing
• Title not available (Why is that?)
• Convergence rates for Tikhonov regularisation of non-linear ill-posed problems
• Well posedness and convergence of some regularisation methods for non-linear ill posed problems
• Sparse regularization with l ^q penalty term
• On Tikhonov regularization with non-convex sparsity constraints
• Title not available (Why is that?)
• Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems
• An extension of the variational inequality approach for obtaining convergence rates in regularization of nonlinear ill-posed problems
• Non-convex sparse regularisation
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
• A variational formulation for frame-based inverse problems
• Convergence criterion of the residual method
• Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
• Generalized Bregman distances and convergence rates for non-convex regularization methods
• Regularization with non-convex separable constraints
• Some tendencies in the Tikhonov regularization of ill-posed problems
• Title not available (Why is that?)
• A New Approach to Source Conditions in Regularization with General Residual Term
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence rates for Tikhonov regularization based on range inclusions
• Title not available (Why is that?)
• Minimization of Tikhonov functionals in Banach spaces

Cited In (20)

• The elementary residual method
• Title not available (Why is that?)
• Convergence and adaptive discretization of the IRGNM Tikhonov and the IRGNM Ivanov method under a tangential cone condition in Banach space
• Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
• Existence of variational source conditions for nonlinear inverse problems in Banach spaces
• On convergence and convergence rates for Ivanov and Morozov regularization and application to some parameter identification problems in elliptic PDEs
• Diffusion tensor imaging with deterministic error bounds
• Regularization Methods for Ill-Posed Problems
• A TGV-based framework for variational image decompression, zooming, and reconstruction. I: Analytics
• Regularization graphs—a unified framework for variational regularization of inverse problems
• Infinite-dimensional inverse problems with finite measurements
• Joint additive Kullback–Leibler residual minimization and regularization for linear inverse problems
• Data-Driven Morozov Regularization of Inverse Problems
• Solving an inverse source problem by deep neural network method with convergence and error analysis
• NETT: solving inverse problems with deep neural networks
• Variational regularisation for inverse problems with imperfect forward operators and general noise models
• Title not available (Why is that?)
• Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
• A New Approach to Source Conditions in Regularization with General Residual Term
• Image Reconstruction with Imperfect Forward Models and Applications in Deblurring

This page was built for publication: The residual method for regularizing ill-posed problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425458)