Papers › Mean squared error minimization for inverse moment problems

Mean squared error minimization for inverse moment problems

31 Aug 2012arXiv:1208.6398links table onlyarchive 2025-07-28

Didier Henrion, Jean-Bernard Bernard Lasserre, Martin Mevissen

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We consider the problem of approximating the unknown density u∈L²(Ω,λ) of a measure μ on Ω⊂ⁿ, absolutely continuous with respect to some given reference measure λ, from the only knowledge of finitely many moments of μ. Given d∈ and moments of order d, we provide a polynomial p_d which minimizes the mean square error ∫(u-p)²dλ over all polynomials p of degree at most d. If there is no additional requirement, p_d is obtained as solution of a linear system. In addition, if p_d is expressed in the basis of polynomials that are orthonormal with respect to λ, its vector of coefficients is just the vector of given moments and no computation is needed. Moreover p_d→u in L²(Ω,λ) as d→∞. In general nonnegativity of p_d is not guaranteed even though u is nonnegative. However, with this additional nonnegativity requirement one obtains analogous results but computing p_d≥0 that minimizes ∫(u-p)²dλ now requires solving an appropriate semidefinite program. We have tested the approach on some applications arising from the reconstruction of geometrical objects and the approximation of solutions of nonlinear differential equations. In all cases our results are significantly better than those obtained with the maximum entropy technique for estimating u.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections