Heuristic solutions to polynomial moment problems with some convex entropic objectives (Q1815703): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Best Entropy Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Relationships for Entropy-Like Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Moment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrals which are convex functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Revision as of 15:44, 24 May 2024

scientific article
Language Label Description Also known as
English
Heuristic solutions to polynomial moment problems with some convex entropic objectives
scientific article

    Statements

    Heuristic solutions to polynomial moment problems with some convex entropic objectives (English)
    0 references
    0 references
    0 references
    14 April 1997
    0 references
    The author estimates a nonnegative density \(x\) on \(\mathbb{R}^n\), given some of its algebraic or trigonometric moments. The maximum entropy method is to introduce an entropy-like objective function and then solve a convex optimal control problem. Special structures of the problem have been discovered when some particular entropies are used, which include the Boltzmann-Shannon entropy and Burg's entropy. Useful linear relationships among the moments lead to very fast and effective algorithms. Some numerical aspects of the problem are presented.
    0 references
    0 references
    0 references
    0 references
    0 references
    moment problems
    0 references
    maximum entropy method
    0 references
    convex optimal control problem
    0 references
    Boltzmann-Shannon entropy
    0 references
    Burg's entropy
    0 references
    algorithms
    0 references