Heuristic solutions to polynomial moment problems with some convex entropic objectives

DOI10.1007/BF02142809zbMath0860.65053OpenAlexW2068161589MaRDI QIDQ1815703

Wanzhen Huang

Publication date: 14 April 1997

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02142809

zbMATH Keywords

algorithmsconvex optimal control problemmoment problemsmaximum entropy methodBurg's entropyBoltzmann-Shannon entropy

Mathematics Subject Classification ID

Related Items (2)

Adaptive change of basis in entropy-based moment closures for linear kinetic equations ⋮ Approximation of nonnegative functions by means of exponentiated trigonometric polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integrals which are convex functionals
• On the Convergence of Moment Problems
• Duality Relationships for Entropy-Like Minimization Problems
• Convergence of Best Entropy Estimates
• Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
• A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
• Convex Analysis

This page was built for publication: Heuristic solutions to polynomial moment problems with some convex entropic objectives