Generalized projections for non-negative functions

DOI10.1007/BF01874442zbMath0837.62006MaRDI QIDQ1897832

Imre Csiszár

Publication date: 20 May 1996

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

convex subsetslinear inequalitiesgeneralized projections\(f\)-divergenceBergman distancestrictly convex function\(I\)-projectionsexistence of projectionsgeneralization of Pythagoras' theoremmeasurable nonnegative functions

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Sufficiency and information (62B99)

Related Items

Generalized isotone projection cones, Moment closure approximations of the Boltzmann equation based on \(\varphi \)-divergences, Solving Fredholm equations by maximum entropy on the mean. Application to superresolution, Bayesian model diagnostics using functional Bregman divergence, Relative entropy and spectral constraints: some invariance properties of the ARMA class, Robust Statistical Engineering by Means of Scaled Bregman Distances, Generalized projections onto convex sets, Inference in ϕ-families of distributions, Game theoretical optimization inspired by information theory, Quantization and clustering with Bregman divergences, Projection theorems and estimating equations for power-law models, Testing for non-nested conditional moment restrictions using unconditional empirical likelihood, TESTING FOR NONNESTED CONDITIONAL MOMENT RESTRICTIONS VIA CONDITIONAL EMPIRICAL LIKELIHOOD, Entropic Projections and Dominating Points, EXISTENCE AND CHARACTERIZATION OF CONDITIONAL DENSITY PROJECTIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sanov property, generalized I-projection and a conditional limit theorem
• Entropic means
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• I-divergence geometry of probability distributions and minimization problems
• General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
• Approximation–Theoretic Derivation of Logarithmic Entropy Principles for Inverse Problems and Unique Extension of the Maximum Entropy Method to Incorporate Prior Knowledge
• Convergence of best phi -entropy estimates
• Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates