Unification of some deterministic and probabilistic methods for the solution of linear inverse problems via the principle of maximum entropy on the mean
From MaRDI portal
Publication:3123306
DOI10.1088/0266-5611/13/1/011zbMath0868.65032MaRDI QIDQ3123306
Publication date: 6 March 1997
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0266-5611/13/1/011
numerical examples; entropy method; regularisation; linear inverse problems; Tikhonov method; linearly constrained optimisation problem; finite convex programming; deterministic and probabilistic methods; principle of maximum entropy of the mean
65J10: Numerical solutions to equations with linear operators
47A50: Equations and inequalities involving linear operators, with vector unknowns
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
Related Items
The Maximum Entropy on the Mean Method for Image Deblurring, Fourier synthesis via partially finite convex programming