1975/02/01 by Imre Csiszár · 18 citations
Physics and Astronomy · Mathematics · #Statistical Mechanics and Entropy #Advanced Statistical Methods and Models #Mathematical Inequalities and Applications #Mathematics #Lagrange multiplier #Euclidean geometry #Divergence (linguistics) #Regular polygon #Generalization #Minification #Kullback–Leibler divergence #Convergence (economics) #Geometric probability #Multiplier (economics) #Combinatorics #Applied mathematics #Mathematical analysis #Mathematical optimization #Geometry #Statistics
paper · pdf · doi:10.1214/aop/1176996454
openalex publication_date 1975/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Some geometric properties of PD's are established, Kullback's I-divergence playing the role of squared Euclidean distance. The minimum discrimination information problem is viewed as that of projecting a PD onto a convex set of PD's and useful existence theorems for and characterizations of the minimizing PD are arrived at. A natural generalization of known iterative algorithms converging to the minimizing PD in special situations is given; even for those special cases, our convergence proof is more generally valid than those previously published. As corollaries of independent interest, generalizations of known results on the existence of PD's or nonnegative matrices of a certain form are obtained. The Lagrange multiplier technique is not used.