Here is the list of my papers that I have referred
to in my talk, and a short and very incomplete list
of other related papers.
Imre

I.Csiszar
(1975) I-divergence geometry of probability distributions
       and minimization problems, Ann.Probab.3, 146-158.
(1984) Sanov property, generalized I-projection and a con-
       ditional limit theorem, Ann. Probab. 12, 768-793.
(1984) Information geometry and alternating minimization
       procedures /with G.Tusnady/ Statistics& Decisions,
       Suppl.1, 205-237.
(1989) A geometric interpretation of Darroch and Ratcliff's
       generalized iterative scaling. Ann. Statist. 17, 1409-
       1413.
(1991) Why least squares and maximum entropy? An axiomatic
       approach to inference for linear inverse problems.
       Ann. Statist. 19, 2032-2066.
(1995) Generalized projections for non-negative functions.
       Acta Math. Hungar. 68, 161-185.
(1996) Maxent, mathematics, and information theory. In: K.M.
       Hanson and R.N.Silver (eds), Maximum Entropy and Bayesian
       Methods, Kluwer Academic, 35-50.
(1999) MEM pixel correlated solutions for generalized moment
       and interpolation problems /with F.Gamboa and E.Gassiat/
       IEEE Trans. Inform.Theory, to appear
(2000) I-projections revisited /with F.Matus/,in preparation.

 Some papers on axiomatics
J.E.Shore and R.W.Johnson, Axiomatic derivation of the principle
   of maximum entropy and the principle of minimum cross-entropy"
   IEEE Trans. Inform. Theory 26, 1980, 26-37,
   correction 29,1983,942-943.
L.M.Bregman and N.I.Naumova, Arbitration solutions with idal
   point generated by systems of functions. Soviet Math. Dokl.
   30, 1984,583-587.
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 36,1990, 23-30.
J.B.Paris and A.Vencovska, A note on the inevitability of
   maximum entropy. Internat.J.Inex. Reasoning 4,1990, 183-223.

Some other references
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. USSR Comput. Math. and Math.Phys.7,
    1967,200-217
E.T.Jaynes, Papers on Probability, Statistics, and Statistical
    Physics, (R.D.Rosenkrantz,ed.) Reidel, Dordrecht,1983.
J.Kruithoff, Telefoon verkeer rekening, Het Engenieur 52, 1937,
   E15-E16.
S.Kullback, Information Theory and Statistics, Wiley, NY, 1959.
F.Topsoe, Information theoretical optimization techniques.
    Kybernetika 15, 1979, 8-17.