Bregman Distances in Inverse Problems and Partial Differential Equations

DOI10.1007/978-3-319-30785-5_2arXiv1505.05191OpenAlexW2203860643MaRDI QIDQ6150884

Martin Burger

Publication date: 7 March 2024

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (2)

Singular solutions, graded meshes,and adaptivity for total-variation regularized minimization problems ⋮ Upper and lower bounds for the Bregman divergence

This page was built for publication: Bregman Distances in Inverse Problems and Partial Differential Equations