Bregman Distances in Inverse Problems and Partial Differential Equations
From MaRDI portal
Abstract: The aim of this paper is to provide an overview of recent development related to Bregman distances outside its native areas of optimization and statistics. We discuss approaches in inverse problems and image processing based on Bregman distances, which have evolved to a standard tool in these fields in the last decade. Moreover, we discuss related issues in the analysis and numerical analysis of nonlinear partial differential equations with a variational structure. For such problems Bregman distances appear to be of similar importance, but are currently used only in a quite hidden fashion. We try to work out explicitely the aspects related to Bregman distances, which also lead to novel mathematical questions and may also stimulate further research in these areas.
Recommendations
- Singular regularization of inverse problems. Bregman distances and their applications of variational frameworks with singular regularization energies
- On Tikhonov functionals penalized by Bregman distances
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Regular self-proximal distances are Bregman
- Inverse Total Variation Flow
Cited in
(6)- Upper and lower bounds for the Bregman divergence
- Singular solutions, graded meshes, and adaptivity for total-variation regularized minimization problems
- Bregman methods for large-scale optimization with applications in imaging
- Exact continuous relaxations of _0-regularized criteria with non-quadratic data terms
- MirrorCBO: a consensus-based optimization method in the spirit of mirror descent
- Error estimates for weakly convex frame-based regularization including learned filters
This page was built for publication: Bregman Distances in Inverse Problems and Partial Differential Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150884)
