Iterative regularization with a general penalty term—theory and application to L 1 and TV regularization

DOI10.1088/0266-5611/28/10/104010zbMath1269.47054OpenAlexW2062460234MaRDI QIDQ3144018

No author found.

Publication date: 6 December 2012

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/28/10/104010

zbMATH Keywords

Tikhonov regularizationill-posed problemsconvex analysissparse reconstructionnoise reductionnumerical costs

Mathematics Subject Classification ID

Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52) Applications of operator theory in numerical analysis (47N40)

Related Items (23)

A novel two-point gradient method for regularization of inverse problems in Banach spaces ⋮ Generalized inexact Newton regularization for nonlinear ill-posed problems in Banach spaces ⋮ Convergence rates of a dual gradient method for constrained linear ill-posed problems ⋮ Inexact Newton--Landweber Iteration in Banach Spaces with NonSmooth Convex Penalty Terms ⋮ Heuristic rule for inexact Newton-Landweber iteration with convex penalty terms of nonlinear: ill-posed problems ⋮ Stochastic mirror descent method for linear ill-posed problems in Banach spaces ⋮ A fast adaptive algorithm for nonlinear inverse problems with convex penalty ⋮ Dual gradient method for ill-posed problems using multiple repeated measurement data ⋮ Deep unfolding as iterative regularization for imaging inverse problems ⋮ Iterative regularization via dual diagonal descent ⋮ An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty ⋮ Inexact Newton regularization in Banach spaces based on two-point gradient method with uniformly convex penalty terms ⋮ A revisit on Landweber iteration ⋮ Alternating Direction Method of Multipliers for Linear Inverse Problems ⋮ Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms ⋮ On the acceleration of the double smoothing technique for unconstrained convex optimization problems ⋮ Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces ⋮ The two-point gradient methods for nonlinear inverse problems based on Bregman projections ⋮ Regularization of inverse problems by two-point gradient methods in Banach spaces ⋮ Accelerated Iterative Regularization via Dual Diagonal Descent ⋮ Random minibatch subgradient algorithms for convex problems with functional constraints ⋮ Implicit regularization with strongly convex bias: Stability and acceleration ⋮ Iterative regularization for constrained minimization formulations of nonlinear inverse problems

This page was built for publication: Iterative regularization with a general penalty term—theory and application to L ¹ and TV regularization