A numerical study of heuristic parameter choice rules for total variation regularization

DOI10.1515/jip-2012-0074zbMath1282.65062OpenAlexW2318147017MaRDI QIDQ5395966

Lawrence Mutimbu, Elena Resmerita, Stefan Kindermann

Publication date: 5 February 2014

Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jip-2012-0074

zbMATH Keywords

numerical examplelinear inverse problemtotal variation regularizationBregman distanceHanke-Raus rulequasi-optimality ruleheuristic parameter choice rulesstrict convergence metric

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (9)

Multiresolution Parameter Choice Method for Total Variation Regularized Tomography ⋮ Iterative Lavrentiev regularization method under a heuristic rule for nonlinear ill-posed operator equations ⋮ Convergence rates for nonlinear inverse problems of parameter identification using Bregman distances ⋮ A numerical comparison of some heuristic stopping rules for nonlinear Landweber iteration ⋮ A convex inversion framework for identifying parameters in saddle point problems with applications to inverse incompressible elasticity ⋮ Analyzing the role of the Inf-Sup condition for parameter identification in saddle point problems with application in elasticity imaging ⋮ Unnamed Item ⋮ A simplified L-curve method as error estimator ⋮ Contingent derivatives and regularization for noncoercive inverse problems

This page was built for publication: A numerical study of heuristic parameter choice rules for total variation regularization