Article PDF
Avoid common mistakes on your manuscript.
References
S. M. Ali and S. D. Silvey, A general class of coefficients of divergence of one distribution from another,J. Roy. Statist. Soc. Ser. B,28 (1966), 131–142.
A. Ben-Tal, A. Charnes and M. Teboulle, Entropic means,Math. Anal. Appl.,139 (1989), 537–551.
J. M. Borwein and A. S. Lewis, Partially-finite programming inL 1 and the existence of maximum entropy estimates,SIAM J. Optimization,3 (1993), 248–267.
L. M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming,U.S.S.R. Comput. Math. Phys.,7 (1967), 200–217.
B. Buck and V. A. Macaulay editors,Maximum Entropy in Action. Oxford University Press (Oxford, 1991).
I. Csiszár, Eine informationstheoretische Ungleichung und ihre Anwendung auf den Beweis der Ergodizität von Markoffschen Ketten,Publ. Math. Inst. Hungar. Acad. Sci.,8 (1963), 85–108.
I. Csiszár, Information-type measures of the difference of probability distributions and indirect observations,Studia Sci. Math. Hungar.,2 (1967), 299–318.
I. Csiszár,I-divergence geometry of probability distributions and minimization problems,Ann. Probab.,3 (1975), 146–158.
I. Csiszár, Sanov property, generalizedI-projection and a conditional limit theorem,Ann. Probab.,12 (1984), 768–793.
I. Csiszár, Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems,Ann. Statist.,19 (1991), 2031–2066.
F. Itakura and S. Saito, Analysis synthesis telephony based on the maximum likelihood method, inReports of the Sixth International Congress on Acoustics (Y. Kohashi, ed.) (1968), pp. 17–22, Tokyo, Japan.
L. Jones, Approximation-theoretic derivation of logarithmic entropy principles for inverse problems and unique extension of the maximum entropy method to incorporate prior knowledge,SIAM J. Appl. Math.,49 (1989) pp. 650–661.
L. Jones and C. Byrne, General entropy criteria for inverse problems with applications to data compression, pattern classification, and cluster analysis,IEEE Trans. Inform. Theory, IT-36 (1990), 23–30.
M. A. Krasnoselskii and Ja. B. Rutickii,Convex Functions and Orlicz Spaces (in Russian), Gos. Izd. Fiz.-Mat. Lit. (Moscow, 1958).
F. Liese and I. Vajda,Convex Statistical Distances, Teubner (Leipzig, 1987).
C. Schroeder,Geometry of general cross entropy functionals. Manuscript.
M. Teboulle and I. Vajda, Convergence of best ϕ-entropy estimates,IEEE Trans. Inform. Theory, IT-39 (1993), 297–301.
F. Topsøe, Information theoretical optimization techniques,Kybernetika,15 (1979), 7–17.
Author information
Authors and Affiliations
Additional information
Dedicated to Károly Tandori on his 70th birthday
This work was supported by Hungarian National Foundation for Scientific Research, Grant 1906, and it was completed while the author was visiting professor at NTT Kanaya Research Laboratory, Take, Japan.
Rights and permissions
About this article
Cite this article
Csiszár, I. Generalized projections for non-negative functions. Acta Math Hung 68, 161–186 (1995). https://doi.org/10.1007/BF01874442
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01874442