1. Akaho, S.: The e-PCA and m-PCA: dimension reduction of parameters by information geometry. In: 2004 IEEE International Joint Conference on Neural Networks, pp. 29–134 (2004)
2. Amari, S., Nagaoka, H.: Methods of Information Geometry. American Mathematical Society, Providence (2001)
3. Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with Bregman divergences. J. Mach. Learn. Res. 6, 1705–1749 (2005)
4. Borchers, B.: CSDP, AC library for semidefinite programming. Optim. Methods Softw. 11, 613–623 (1999)
5. Bregman, L.M.: 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. Math. Phys. 7, 200–217 (1967)