Abstract
We characterize the existence of the Lebesgue integrable solutions of the truncated problem of moments in several variables on unbounded supports by the existence of some maximum entropy—type representing densities and discuss a few topics on their approximation in a particular case, of two variables and 4th order moments.
Similar content being viewed by others
References
Abramov, R.V.: The multidimensional maximum entropy moment problem: a review on numerical methods. Commun. Math. Sci 8(2), 377–392 (2010)
Ambrozie, C.-G.: Maximum entropy and moment problems. Real Anal. Exch. 29(2), 607–627 (2003/04)
Ambrozie, C.-G.: Truncated moment problems for representing densities and the Riesz–Haviland theorem. J. Operator Theory. arXiv:1111.6555 (to appear)
Ambrozie, C.-G.: Finding positive matrices subject to linear restrictions. Linear Algebra Appl. 426:2–3, 716–728 (2007)
Akhiezer, N.I.: The classical moment problem. Hafner Publ. Co., New York (1965)
Au, J.D.: Lösung Nichtlinearer problems in der Erweiterten Thermodynamik. PhD thesis, Technische Universität Berlin (2001)
Bakonyi, M., Woerdeman, H.J.: Maximum entropy elements in the intersection of an affine space and the cone of positive definite matrices. SIAM J. Matrix Anal. Appl. 16(2), 369–376 (1995)
Bertsimas, D., Doan, X.V., Lasserre, J.B.: Approximating integrals of multivariate exponentials: a moment approach. Oper. Res. Lett. 36(2), 205–210 (2008)
Borwein, J.M.: Maximum entropy and feasibility methods for convex and nonconvex inverse problems, optimization. J. Math. Program. Oper. Res. 61:1(2012).
Borwein, J.M., Lewis, A.S.: Duality relationships for entropy-like minimization problems. SIAM J. Cont. Optim. 29(2), 325–338 (1991)
Borwein, J.M., Lewis, A.S: Partially finite convex programming. I. Quasi relative interiors and duality theory. Math. Program. 57:1, Ser. B, 15–48 (1992)
Blekherman, G., Lasserre, J.B.: The truncated \(K\)-moment problem for closure of open sets. J. Funct. Anal. 263(11), 3604–3616 (2012)
Van Campenhout, J.M., Cover, T.M.: Maximum entropy and conditional probability. IEEE Trans. Inf. Theory. IT-27, 483–489 (1981)
Cercignani, C. (ed.): Kinetic Theories and the Boltzmann Equation. Lecture Notes in Mathematics, vol. 1048. Springer-Verlag, Berlin (1984)
Curto, R.E., Fialkow, L.A.: An analogue of the Riesz–Haviland theorem for the truncated moment problem. J. Funct. Anal. 255(10), 2709–2731 (2008)
Curto, R.E., Fialkow, L.A.: Solution of the truncated complex moment problem for flat data. Mem. Amer. Math. Soc. 119(568), x+32 (1996)
Fuglede, B.: The multidimensional moment problem. Exp. Math. 1, 47–65 (1983)
Groth, C.P., McDonald, J.G.: Towards physically realizable and hyperbolic moment closures for kinetic theory. Continuum Mech. Thermodyn. 21, 467–493 (2009)
Haviland, E.K.: On the momentum problem for distributions in more than one dimension, I. Am. J. Math. 57, 562–568 (1935)
Jaynes, E.T.: On the rationale of maximum entropy methods. Proc. IEEE. 70, 939–952 (1982)
Junk, M.: Minimum relative entropy systems of the Boltzmann equation (Unpublished work)
Junk, M.: Domain of definition of Levermore’s five-moment system. J. Stat. Phys. 93, 1143–1167 (1998)
Junk, M.: Maximum entropy for reduced moment problems. Math. Models Methods Appl. Sci. 10:7(2000), 1001–1025
Junk, M.: Maximum entropy moment problems and extended Euler equations. Transp. Transition Regimes (MN, 2000), 169–198, IMA Vol. Math. Appl., 135, Springer, New York (2004)
Prestel, A., Delzell, C.N.: Positive polynomials. From Hilbert’s 17th problem to real algebra. Springer Monographs in Mathematics. Springer, Berlin (2001)
Putinar, M., Budišić, M.: Conditioning moments of singular measures for entropy optimization I. Indagationes Mathematicae 23(4), 848–883 (2012)
Hauck, C.D., Levermore, C.D., Tits, A.L.: Convex duality and entropy-based moment closures; characterizing degenerate densities. SIAM J. Control Optim. 47:4, 1977–2015 (2008)
Lasserre, J.B.: Semidefinite programming for gradient and Hessian computation in maximum entropy estimation. Proceedings of the IEEE CDC conference, December (2007)
Lasserre, J.B.: A semidefinite programming approach to the generalized problem of moments. Math. Program. 112:1, Ser. B, 65–92 (2008)
Léonard, C.: Minimization of entropy functionals. J. Math. Anal. Appl. 346:1, 183–204 (2008)
Lewis, A.S.: Consistency of moment systems. Can. J. Math. 47, 995–1006 (1995)
Mead, L.R., Papanicolaou, N.: Maximum entropy and the problem of moments. J. Math. Phys. 25(8), 2404–2417 (1984)
Moreau, J.J.: Sur la polaire d’une fonction semi-continue supérieurement, Comptes Rendus de l’Academie des Sciences, vol. 258 (1964)
Putinar, M., Scheiderer, C.: Multivariate moment problems: geometry and indeterminateness. Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 5(2), 137–157 (2006)
Putinar, M., Vasilescu, F.-H.: Solving moment problems by dimensional extension. Ann. Math. (2) 149(3), 1087–1107 (1999)
Rockafellar, R.T.: Extension of Fenchel’s duality for convex functions. Duke Math. J. 33, 81–89 (1966)
Shohat, J., Tamarkin, J.: The problem of moments. Math. Surv. I, Am. Math. Soc., Providence, RI (1943)
Cichoń, D., Stochel, J., Szafraniec, F.H.: Riesz–Haviland criterion for incomplete data. J. Math. Anal. Appl. 380:1, 94–104 (2011)
Tagliani, A.: Maximum entropy in the Hamburger moments problem. J. Math. Phys 35(9), 5087–5096 (1994)
Vasilescu, F.-H.: Moment problems for multi-sequences of operators. J. Math. Anal. Appl. 219(2), 246–259 (1998)
Acknowledgments
The present work was supported by the Czech grant IAA 100190903 GA AV (RVO: 67985840) and the Romanian grant CNCS UEFISCDI, no. PN-II-ID-PCE-2011-3-0119. I wish to express my thanks to professor Marian Fabian for drawing the results of the Fenchel duality theory to my attention. Also, I thank professor Mihai Putinar for several interesting suggestions and relevant references. The author is also indebted to the reviewers for their expert indications and reference to more recent works, that definitely improved the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the Czech grant IAA100190903 GAAV (RVO: 67985840) and the Romanian grant CNCS UEFISCDI, no. PN-II-ID-PCE-2011-3-0119.
Appendix: The functions \({r}_{{j\, i}}\)
Appendix: The functions \({r}_{{j\, i}}\)
We give an algorithm to recurrently compute \(r_{ji},c_{ji}\), in particular solve (12) to finish the proof of Proposition 8. Set \(\delta _k =\delta _{(l+1-k,k)\, j_0 }\) for \(0\le k\le l+1\). Let \(\alpha _k =a_{(l-2-k,k)}\), \(\beta _k =b_{(l-2-k,k)}\) for \(0\! \le \! k\! \le \! l\! -\! 2\). Thus \(\alpha _k ,\beta _k =0\) for \(k<0\), \(k\ge l-1\). Also \(x_\kappa =0\) if \(\kappa \not \ge 0\). Change the summation indices in (12) by \(j\! =\! i\! +\! e_{1,2}\! -\! \iota \) (\( \ge \! 0\)). Then (12) becomes \(\sum _{|j|=l-2, (j_2 \le i_2) }(i_1 -j_1 +1)x_{i-j+e_1}b_j -\sum _{|j|=l-2,( j_2 \le i_2)}(i_2 -j_2 +1)x_{i-j+e_2}a_j =\delta _{ij_0}\) where the (redundant) condition \(j_2\le i_2\) follows from \(j\le i\), that comes from \(\iota \ge e_{1,2}\). For every \(i=(l+1-k,k)\) with \(0\le k\le l+1\), we have the equivalence \((j\ge 0,|j|=l-2, j_2 \le i_2)\, \Leftrightarrow \, j=(l-2-p,p)\) for \(0\le p\le k\) and hence the \(l+1\) equations in (12) become now, respectively,
If \(l\ge 5\), let \(\alpha _0 ,\ldots ,\alpha _{l-5}=0\) and define \(\beta _0 ,\ldots ,\beta _{l-5}\) inductively by\( 4x_{40}\beta _k = -\sum _{p=0}^{k-1}(4+p-k)x_{(4+p-k,\, k-p)}\beta _p +\delta _k\) (\(0\le k\le l-5\)) where \(\sum _\emptyset :=0\). Note that \(x_{40}<0\) since \(g\in G\). This fulfills (15) for \(0\le k\le l-5\). Last six equations in (12) [(\(l-4\le k\le l+1\) in (15)] will provide \(\alpha _k ,\beta _k \) (\(l-4\le k\le l-2\)). If \(l=4\), skip this step and go directly to the linear \(6\times 6\) system [(in this case (16) for \(y,z,w=0\)]. In any case, we let now \(i=(l+1-k,k)\) for \(0\le k\le l+1\) in (12). We have \(i+e_{1}-\iota =(l+2-k -\iota _1 ,k-\iota _2)\) and \(i+e_2 -\iota =(l+1-k-\iota _1 ,k-\iota _2 +1)\). Last 6 equations in (12) become \(\sum _{|\iota |=4} \! \iota _1 x_\iota \beta _{k -\iota _2 } \! -\! \sum _{|\iota |=4} \! \iota _2 x_\iota \alpha _{k-\iota _2 +1}=\delta _k \) (\(l-4\le k\le l+1\)), see below. The brackets \(( )\) border quantities already known in terms of \(\beta _0 ,\ldots ,\beta _{l-5}\). The markers \(\lfloor \rceil \) border sums of terms that are null due to \(\iota _{1,2}=0\), \(\alpha _k ,\beta _k =0\) (\(k\ge l-1\)) or \(\alpha _k =0\) (\(0\le k\le l-5\)):
Set \(y\! =\! -3x_{31}\beta _{l-5} \! -\! 2x_{22}\beta _{l-6}\! -\! x_{13}\beta _{l-7}\), \( z\! =\! -2x_{22}\beta _{l-5}\! -\! x_{13}\beta _{l-6}\) and \(w\! =\! -x_{13}\beta _{l-5}\).
We easily read from above that \(\alpha _k ,\beta _k\) for \(k\! =\! l-4,\, l-3,\, l-2\) are given by
(note also that \(g\in G_0\)). We have \(a_j, b_j\), and so \(u, v\) such that \(\text{ deg}\, (L(u,v)-t^{j_0})\le l\). Now \(\pi =t^{j_0}-L\) is determined by summing the terms of degree \(\le l\) in \(-L\). For \(m=1,2\) set \(K_m = \{ (j,\iota ): |j|=l-2, |\iota |\le 3, \iota _m \ge 1\}\). Then
For any \(i\ge 0\) with \(|i|\le l\), the coefficient of \(t^i\) in the sum \(\Sigma _{K_2}\) from above is \(\sum _{(j,\, \iota )\in K_2 (i) }a_j \iota _2 x_\iota \) where \(K_2 (i)= \{ (j,\iota )\in K_2 :j+\iota -e_2 =i\}\). The map \(K_2 (i)\ni (j,\iota )\mapsto i-j\) is bijective onto \(I_i :=\{ \kappa \ge 0 :\kappa \le i,|\kappa |=|i|+2-l\}\). Then we may use it to change the summation index by \(\kappa =i-j\) and get the coefficient of \(t^i\) in \(\Sigma _{K_2}\) as \(\sum _{\kappa \in I_i} (\kappa _2 +1)a_{i-\kappa }x_{\kappa +e_2}\). Similarly, the coefficient of \(t^i\) in \(\Sigma _{K_1}\) is \(\sum _{\kappa \in I_i}(\kappa _1 +1)b_{i-\kappa }x_{\kappa +e_1}\). The coefficient \(c_{j_0 i}\) (\(=\, \)a rational function \(c_{\, lj_0 i}(x)\) of \(x\), actually) of \(t^i\) in \(\pi (t)\) is then
where \(d_{j_0 i}\! =\! (i_2 +1)a_{i+e_2 }\! -\! (i_1 +1)b_{i+e_1 }\) if \( |i|\! =\! l-3\), and 0 otherwise. We have
Successive compositions of the mapping \((g_i)_{|i|\le l}\mapsto ((g_{j_0})_{|j_0 |=l+1},\, (g_i)_{|i|\le l})=\) \((g_i)_{|i|\le l+1}\) given by (18) for \(l=4,5,\ldots \) provide us with \(r_{ji}(x)\) such that
Thus (16)–(19) provide \(c_{ji},r_{ji}\). Since \(\det A x \! \not =\! 0\) and \(x_{40}\! =\! \sum _{|i|=4}x_{i}t^i |_{t=e_1 }\! <\! 0\), the denominators of the rational functions \(r_{ji}\) do not vanish at \(x=\lambda ^*\). \(\square \)
It would be interesting to generalize Proposition 8 to arbitrary \(n\) and \(k\), for a class of simple domains \(T\) including \(\mathbb R ^n\), \([0,\infty )^n\) and get rid of assumptions like \(g\in G_0 , G\), for Lagrangians \(L_\epsilon \) with \(\epsilon >0\). Also, numerical tests of systems like (13) could be tried.
Rights and permissions
About this article
Cite this article
Ambrozie, C.G. Multivariate truncated moments problems and maximum entropy. Anal.Math.Phys. 3, 145–161 (2013). https://doi.org/10.1007/s13324-012-0052-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13324-012-0052-3