The convergence of entropy-based approximations for moment problems

DOI10.1080/02331939408843930zbMath0816.41017OpenAlexW2059276768MaRDI QIDQ3835649

Adrian S. Lewis

Publication date: 20 July 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843930

zbMATH Keywords

moment problemdualitynonlinear approximationBurg entropy

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Approximation by other special function classes (41A30)

Cites Work

• Unnamed Item
• Well-posed optimization problems
• Problem of search of the minimum of entropy in indeterminate extension problems
• Fréchet differentiability of convex functions
• Computationally feasible high-resolution minimum-distance procedures which extend the maximum-entropy method
• An Extension Problem for Non-negative Hermitian Block Toeplitz Matrices. II
• Recovering a function from a finite number of moments
• 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
• On an inverse problem of entropy othimization and related questions
• Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
• Convex Analysis

This page was built for publication: The convergence of entropy-based approximations for moment problems