A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
From MaRDI portal
Publication:4764309
DOI10.1137/0805004zbMath0820.49016OpenAlexW1975590982MaRDI QIDQ4764309
Wanzhen Huang, Jonathan M. Borwein
Publication date: 29 August 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0805004
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Related Items (6)
Adaptive change of basis in entropy-based moment closures for linear kinetic equations ⋮ Maximum entropy and feasibility methods for convex and nonconvex inverse problems ⋮ On some filtering problems arising in mathematical finance ⋮ Heuristic solutions to polynomial moment problems with some convex entropic objectives ⋮ A maximum entropy method for solving Frobenius-Perron operator equations ⋮ Approximation of nonnegative functions by means of exponentiated trigonometric polynomials
This page was built for publication: A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
