References
- Amari, S., and A. Cichocki. 2010. Information theory of divergence functions. Bulletin of the Polish Academy of Sciences: Technical Sciences 58 (1):183–95. doi:https://doi.org/10.2478/v10175-010-0019-1.
- Amari, S., and H. Nagaoka. 2000. Methods of information geometry. Transl. of Mathem. Monographs, Vol. 191. New York: Oxford University Press.
- Arnold, B. C., E. Castillo, and J. M. Sarabia. 1999. Conditional specification of statistical models. New York: Springer Verlag.
- Banerjee, A., I. Dhillon, I. Ghosh, S. Merugu, and Ds Modhi. 2008. A generalized maximum entropy approach to Bregman co-clustering and matrix approximation. Journal of Machine Learning Research 8:1919–86.
- Banerjee, A., X. Guo, and H. Wang. 2005. On the optimality of conditional expectation as Bregman predictor. IEEE Transactions on Information Theory 51 (7):2664–9. doi:https://doi.org/10.1109/TIT.2005.850145.
- Basseville, M. 2013. Divergence measures for statistical data processing: An annotated bibliography. Signal Processing 93 (4):621–33. doi:https://doi.org/10.1016/j.sigpro.2012.09.003.
- Bauschke, H. H., and A. S. Lewis. 2000. Dykstras algorithm with Bregman projections: A convergence proof. Optimization 48 (4):409–27. doi:https://doi.org/10.1080/02331930008844513.
- Bauschke, H. H., and P. L. Combettes. 2003. Construction of best Bregman approximation in reflective Banach spaces. Proceedings of the American Mathematical Society 131 (12):3757–66. doi:https://doi.org/10.1090/S0002-9939-03-07050-3.
- Bauschke, H. H., J. M. Borwein, and P. L. Combettes. 2003. Bregman monotone optimization algorithms. SIAM Journal on Control and Optimization 42 (2):596–636. doi:https://doi.org/10.1137/S0363012902407120.
- Baushke, H. H., and J. M. Borweinn. 1997. Legendre functions and the method of random Bregman projections. Journal of Convex Analysis 4:27–67.
- Boissonnat, J.-D., F. Nielsen, and R. Nock. 2010. Bregman Voronoi diagrams: Properties, algorithms and applications. Discrete & Computational Geometry 44 (2):281–307. doi:https://doi.org/10.1007/s00454-010-9256-1.
- Bregman, L. 1967. The relaxation method of finding common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7:2100–217.
- Butnariu, D., and E. Resmerita. 2006. Bregman distances, totally convex functions, and a method for solving operator equations. Abstract and Applied Analysis 2006:1–39. doi:https://doi.org/10.1155/AAA/2006/84919.
- Calin, O., and C. Urdiste. 2010. Geometric modeling in probability and statistics. Switzerland: Springer - International Publisher.
- Censor, Y., and M. Zaknoon. 2018. Algorithms and convergence results of projection methods for inconsistent feasibility problems: A review. arXiv:1802.07529v3 [math.OC].
- Censor, Y., and S. Reich. 1998. The Dykstra algorithm with Bregman projections. Communications in Applied Analysis 2:407–19.
- Chen, H.-S., K. Lai, and Z. Ying. 2004. Goodnes of fit tests and minimum power divergence estimators for survival data. Statistica Sinica 14:231–48.
- Cressie, T. R. C., and N. A. C. Read. 1988. Goodness-of-fit statistics for discrete multivariate data. New York: Springer Verlag.
- Csiszár, I. 1967. Information type measures of difference of probability distributions and indirect observations. Studia Scientiarum Mathematicarum Hungarica 2:299–318.
- Csiszár, I. 2008. Axiomatic characterization of information measures. Entropy 10 (3):261–73. doi:https://doi.org/10.3390/e10030261.
- Fischer, A. 2010. Quantization and clustering with Bregman divergences. Journal of Multivariate Analysis 101 (9):2207–21. doi:https://doi.org/10.1016/j.jmva.2010.05.008.
- Ghosh, I., and N. Balakrishnan. 2015. Study of incompatibility or near compatibility of bivariate discrete conditional probability distributions through divergence measures. Journal of Statistical Computation and Simulation 85 (1):117–30. doi:https://doi.org/10.1080/00949655.2013.806509.
- Ghosh, I., and S. Nadarajah. 2017. On the construction of a joint distribution given two discrete conditionals. Studia Scientiarum Mathematicarum Hungarica 54 (2):178–204. DOI:. doi:https://doi.org/10.1556/012.2017.54.2.1361.
- Gzyl, H. 2017. Prediction in logarithmic distance. http://arxiv.org/abs/1703.08696
- Lang, S. 1999. Math talks for undergraduates. New York: Springer.
- Lawson, J. D., and Y. Lim. 2001. The geometric mean, matrices, metrics and more. The American Mathematical Monthly 108 (9):797–812. doi:https://doi.org/10.1080/00029890.2001.11919815.
- Li, C., W. Song, and J.-C. Yao. 2010. The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces. Journal of Approximation Theory 162 (6):1128–49. doi:https://doi.org/10.1016/j.jat.2009.12.006.
- Lorenzen, G. 1995. A new family of goodness-of-fit statistics for discrete multivariate data. Statistics & Probability Letters 25 (4):301–7. doi:https://doi.org/10.1016/0167-7152(94)00234-8.
- Moahker, M. 2005. A differential geometric approach to the geometric mean of symmetric positive definite matrices. SIAM. Journal on Matrix Analysis and Applications 26:735–47.
- Nielsen, F. 2018. An elementary introduction to information theory. https://arxiv.org/abs/1808.08271
- Österreicher, F. 2002. Csiszár’s f-divergence- Basic properties. http://www.sbg.ac.at/mat/home.hmtl.
- Pollard, D. 2002. A user’s guide to measure theoretic probability. Cambridge: Cambridge University Press.
- Schwartzman, A. 2015. Lognormal distribution and geometric averages of positive definite matrices. International Statistical Review. 84:456–86.
- Stummer, W., and I. Vajda. 2012. On Bregman distances and divergences of probability measures. IEEE Transactions on Information Theory 58 (3):1277–88. doi:https://doi.org/10.1109/TIT.2011.2178139.
- Ullah, A. 1996. Entropy, divergence and distance measures with economic applications. Journal of Statistical Planning and Inference 49 (1):137–62. doi:https://doi.org/10.1016/0378-3758(95)00034-8.
- Vajda, I. 2009. On metric divergences of probability measures. Kybernetica 45:885–900.