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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q587981
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Stefan Mititelu / rank
 
Normal rank

Revision as of 12:17, 16 February 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