Polynomial bases on the numerical solution of the multivariate discrete moment problem
From MaRDI portal
Publication:1931645
DOI10.1007/s10479-011-0878-3zbMath1254.90141OpenAlexW2069694851MaRDI QIDQ1931645
Publication date: 15 January 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0878-3
linear programmingexpectation boundsprobability boundsdiscrete moment problemmultivariate Lagrange interpolation
Related Items
The discrete moment problem with fractional moments ⋮ Robust newsvendor problems: effect of discrete demands
Uses Software
Cites Work
- Unnamed Item
- The discrete moment problem and linear programming
- A comparison of interpolation grids over the triangle or the tetrahedron
- The condition of Vandermonde-like matrices involving orthogonal polynomials
- Optimally stable multivariate bases
- Legendre-Bernstein basis transformations
- On the \(p\)-norm condition number of the multivariate triangular Bernstein basis
- Inequalities on expectations based on the knowledge of multivariate moments
- On the \(L_1\)-condition number of the univariate Bernstein basis
- A class of multiattribute utility functions
- Sharp Bounds on Probabilities Using Linear Programming
- On Multivariate Discrete Moment Problems: Generalization of the Bivariate Min Algorithm for Higher Dimensions
- Boole-Bonferroni Inequalities and Linear Programming
- Scaling for Numerical Stability in Gaussian Elimination
- Asymptotically Optimal Lower Bounds for the Condition Number of a Real Vandermonde Matrix
- A method to find the best bounds in a multivariate discrete moment problem if the basis structure is given
- Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances
- Construction of Gauss-Christoffel Quadrature Formulas
- On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities
