Heuristic solutions to polynomial moment problems with some convex entropic objectives
From MaRDI portal
(Redirected from Publication:1815703)
Recommendations
Cites work
- A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
- Convergence of Best Entropy Estimates
- Convex Analysis
- Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
- Duality Relationships for Entropy-Like Minimization Problems
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 762943 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Integrals which are convex functionals
- On the Convergence of Moment Problems
Cited in
(6)- Approximation of nonnegative functions by means of exponentiated trigonometric polynomials
- Adaptive change of basis in entropy-based moment closures for linear kinetic equations
- The convergence of entropy-based approximations for moment problems
- A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
- On the computability of continuous maximum entropy distributions with applications
- Mean squared error minimization for inverse 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)