Abstract
This paper deals with quantitative aspects of regularization for ill-posed linear equations in Banach spaces, when the regularization is done using a general convex penalty functional. The error estimates shown here by means of Bregman distances yield better convergences rates than those already known for maximum entropy regularization, as well as for total variation regularization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have