Maximum Entropy Regularization for Fredholm Integral Equations of the First Kind
- 1 November 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 24 (6) , 1557-1576
- https://doi.org/10.1137/0524088
Abstract
The regularization of Fredholm integral equations of the first kind is considered with positive solutions by means of maximum entropy. The regularized solution is the minimizes of a functional analogous to the case of Phillips–Tikhonov regularization. The regularized solution is shown to converge to the solution of the maximum entropy least squares problem, assuming it exists. Under additional regularity conditions akin to those for Phillips–Tikhonov regularization error estimates are obtained as well. In addition it is shown that the regularity conditions are necessary for these estimates to hold. Approximation from finite-dimensional subspaces are also considered, as well as exact and approximate moment problems for the integral equations. The basic tools in the analysis are the weak compactness of subsets of $L_1$ consisting of functions of bounded entropy, and an inequality for convex optimization problems with Bregman functionals.
Keywords
This publication has 20 references indexed in Scilit:
- Convergence Rates for Maximum Entropy RegularizationSIAM Journal on Numerical Analysis, 1993
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman FunctionsSIAM Journal on Optimization, 1993
- Maximum entropy regularization of Fredholm integral equations of the first kindInverse Problems, 1991
- Convergence of Best Entropy EstimatesSIAM Journal on Optimization, 1991
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- Estimating Solutions of First Kind Integral Equations with Nonnegative Constraints and Optimal SmoothingSIAM Journal on Numerical Analysis, 1981
- Geometric Functional Analysis and its ApplicationsPublished by Springer Nature ,1975
- Restoring with Maximum Likelihood and Maximum Entropy*Journal of the Optical Society of America, 1972
- On the optimum rate of transmitting informationPublished by Springer Nature ,1969
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967