Heuristic solutions to polynomial moment problems with some convex entropic objectives

DOI10.1007/BF02142809zbMATH Open0860.65053OpenAlexW2068161589MaRDI QIDQ1815703FDOQ1815703

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

Recommendations

• A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
• Maximum entropy in the generalized moment problem
• scientific article

zbMATH Keywords

algorithmsBurg's entropymoment problemsmaximum entropy methodBoltzmann-Shannon entropyconvex optimal control problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Moment problems (44A60)

Cites Work

• Title not available (Why is that?)
• Convex Analysis
• Integrals which are convex functionals
• Title not available (Why is that?)
• On the Convergence of Moment Problems
• Duality Relationships for Entropy-Like Minimization Problems
• Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
• Convergence of Best Entropy Estimates
• A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
• Title not available (Why is that?)

Cited In (3)

• Adaptive change of basis in entropy-based moment closures for linear kinetic equations
• Approximation of nonnegative functions by means of exponentiated trigonometric polynomials
• The convergence of entropy-based approximations for moment problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815703)