Abstract
The multivariate discrete moment problem (MDMP) has been introduced by Prékopa. The objective of the MDMP is to find the minimum and/or maximum of the expected value of a function of a random vector with a discrete finite support where the probability distribution is unknown, but some of the moments are given. The MDMP can be formulated as a linear programming problem, however, the coefficient matrix is very ill-conditioned. Hence, the LP problem usually cannot be solved in a regular way. In the univariate case Prékopa developed a numerically stable dual method for the solution. It is based on the knowledge of all dual feasible bases under some conditions on the objective function. In the multidimensional case the recent results are also about the dual feasible basis structures. Unfortunately, at higher dimensions, the whole structure has not been found under any circumstances. This means that a dual method, similar to Prékopa’s, cannot be developed. Only bounds on the objective function value are given, which can be far from the optimum. This paper introduces a different approach to treat the numerical difficulties. The method is based on multivariate polynomial bases. Our algorithm, in most cases, yields the optimum of the MDMP without any assumption on the objective function. The efficiency of the method is tested on several numerical examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blyth, M. G., Luo, H., & Pozrikidis, C. (2006). A comparison of interpolation grids over the triangle or the tetrahedron. Journal of Engineering Mathematics, 56, 263–272.
Farouki, R. T. (2000). Legendre-Bernstein basis transformations. Journal of Computational and Applied Mathematics, 119, 145–160.
Gautschi, W. (1968). Construction of Gauss-Christoffel quadrature formulas. Mathematics of Computation, 22(102), 251–270.
Gautschi, W. (1983). The condition of Vandermonde-like matrices involving orthogonal polynomials. Linear Algebra and Its Applications, 52/53, 293–300.
ILOG CPLEX 9 (2010). http://www-01.ibm.com/software/integration/optimization/cplex/
Li, R.-C. (2006). Asymptotically optimal lower bounds for the condition number of a real Vandermonde matrix. SIAM Journal on Matrix Analysis and Applications, 28(3), 829–844.
Lyche, T., & Peña, J. M. (2004). Optimally stable multivariate bases. Advances in Computational Mathematics, 20, 149–159.
Lyche, T., & Scherer, K. (2000). On the p-norm condition number of the multivariate triangular Bernstein basis. Journal of Computational and Applied Mathematics, 119, 259–273.
Lyche, T., & Scherer, K. (2002). On the L 1-condition number of the univariate Bernstein basis. Constructive Approximation, 18, 503–528.
Hou, X., & Prékopa, A. (2007). Monge property and bounding multivariate probability distribution functions with given marginals and covariances. SIAM Journal on Optimization, 18, 138–155.
Mádi-Nagy, G. (2005). A method to find the best bounds in a multivariate discrete moment problem if the basis structure is given. Studia Scientiarum Mathematicarum Hungarica, 42(2), 207–226.
Mádi-Nagy, G. (2009). On multivariate discrete moment problems: generalization of the bivariate min algorithm for higher dimensions. SIAM Journal on Optimization, 19(4), 1781–1806.
Mádi-Nagy, G., & Prékopa, A. (2004). On multivariate discrete moment problems and their applications to bounding expectations and probabilities. Mathematics of Operations Research, 29(2), 229–258.
Mádi-Nagy, G., & Prékopa, A. (2007). Bounding expectations of functions of random vectors with given marginals and some moments: applications of the multivariate discrete moment problem. RUTCOR Research Report 11-2007.
Prékopa, A. (1988). Boole-Bonferroni inequalities and linear programming. Operations Research, 36(1), 145–162.
Prékopa, A. (1990a). Sharp bounds on probabilities using linear programming. Operations Research, 38, 227–239.
Prékopa, A. (1990b). The discrete moment problem and linear programming. Discrete Applied Mathematics, 27, 235–254.
Prékopa, A. (1992). Inequalities on expectations based on the knowledge of multivariate moments. In M. Shaked & Y. L. Tong (Eds.), IMS Lecture Notes: Vol. 22. Stochastic inequalities (pp. 309–331). Hayward: Institute of Mathematical Statistics.
Prékopa, A. (1998). Bounds on probabilities and expectations using multivariate moments of discrete distributions. Studia Scientiarum Mathematicarum Hungarica, 34, 349–378.
Prékopa, A. (2000). On multivariate discrete higher order convex functions and their applications. RUTCOR Research Report 39-2000. Also in: Proceedings of the sixth international conference on generalized convexity and monotonicity, Karlovasi, Samos, Greece, August 29–September 2, to appear.
Prékopa, A., & Mádi-Nagy, G. (2008). A class of multiattribute utility functions. Journal of Economic Theory, 34(3), 591–602.
Samuels, S. M., & Studden, W. J. (1989). Probability, statistics and mathematics, papers in honor of Samuel Karlin. Bonferroni-type probability bounds as an application of the theory of Tchebycheff system (pp. 271–289). San Diego: Academic Press.
Skeel, R. D. (1979). Scaling for numerical stability in Gaussian elimination. Journal of the Association for Computing Machinery, 26(3), 494–526.
Wolfram’s Mathematica (2010). http://www.wolfram.com/.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Professor András Prékopa on his 80th birthday.
Rights and permissions
About this article
Cite this article
Mádi-Nagy, G. Polynomial bases on the numerical solution of the multivariate discrete moment problem. Ann Oper Res 200, 75–92 (2012). https://doi.org/10.1007/s10479-011-0878-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0878-3