Partially-Finite Programming in L₁ and the Existence of Maximum Entropy Estimates

DOI10.1137/0803012MaRDI QIDQ5287102zbMATH OpenOpenAlexFDO

Authors Jonathan M. Borwein, A. S. Lewis

Publication date 11 August 1993

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0803012

zbMATH Keywords

best entropy estimationconvex analysisdualitygeneralized solutionimage reconstructionmaximum entropy methodspectral estimation

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27) Numerical mathematical programming methods (65K05) Computing methodologies for image processing (68U10) Convex programming (90C25) Measures of information, entropy (94A17)

Recommendations

• Maximum entropy in the generalized moment problem
• Maximum entropy in the finite Stieltjes and Hamburger moment problem
• scientific article; zbMATH DE number 762943
• Convergence of Best Entropy Estimates

Cited in

(24)

• A representation formula for the large deviation rate function for the empirical law of a continuous time Markov chain
• Facial reduction in partially finite convex programming
• The maximum entropy method on the mean: Applications to linear programming and superresolution
• Bayesian methods and maximum entropy for ill-posed inverse problems
• Solving Fredholm equations by maximum entropy on the mean. Application to superresolution
• A maxentropic procedure for reconstructing a distribution from its marginals
• Large deviations for random power moment problem.
• Generalized projections for non-negative functions
• An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
• Maximum entropy solution to ill-posed inverse problems with approximately known operator
• Asymptotic properties of the algebraic moment range process
• Existence and characterization of conditional density projections
• Conditional principles for random weighted measures
• A note on cores and quasi relative interiors in partially finite convex programming
• scientific article; zbMATH DE number 4058634 (Why is no real title available?)
• The convergence of entropy-based approximations for moment problems
• Approximate maximum entropy on the mean for instrumental variable regression
• Hodges-Lehmann optimality for testing moment conditions
• Inference in -families of distributions
• Robustness to missing data: breakdown point analysis
• Wasserstein gradient flows for Moreau envelopes of f-divergences in reproducing kernel Hilbert spaces
• On the sufficiency of K-positivity for truncated compactly supported generalized moment problems
• Minimization of entropy functionals
• Optimal experimental design criterion for discriminating semiparametric models

This page was built for publication: Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates

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