Abstract
In a statistical manifold, we can naturally define submanifolds that are simultaneously autoparallel with respect to both the primal and the dual affine connections of the statistical manifold. We call them doubly autoparallel submanifolds. The aim of this paper is to mainly introduce doubly autoparallelism on positive definite matrices in linear algebraic way and show its applicability to two related topics.
Supported by JSPS Grant278 in-Aid (C) 15K04997.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anderson, T.W.: Asymptotically efficient estimation of covariance matrices with linear structure. Ann. Math. 1(1), 135–141 (1971)
Amari, S.: Differential-Geometrical Methods in Statistics. Springer, Heidelberg (1985)
Amari, S., Nagaoka, H.: Methods of Information Geometry. AMS and Oxford, New York (2000)
Bayer, D.A., Lagarias, J.C.: The nonlinear geometry of linear programming I. Trans. Amer. Math. Soc. 314, 499–526 (1989). II, Trans. Amer. Math. Soc. 314, 527–581 (1989)
Burg, J.P., Luengberger, D.G., Wenger, D.L.: Estimation of structured covariance matrices. Proc. IEEE 70(9), 963–974 (1982)
Faybusovich, L.: A hamilton structure for generalized affine-scaling vector fields. J. Nonlinear Sci. 5, 11–28 (1995)
Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Oxford Press, New York (1994)
Kakihara, S., Ohara, A., Tsuchiya, T.: Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs. J. Optim. Theory Appl. 157, 749–780 (2013)
Kakihara, S., Ohara, A., Tsuchiya, T.: Curvature integrals and iteration complexities in SDP and symmetric cone programs. Comput. Optim. Appl. 57, 623–665 (2014)
Karmarkar, N.: Riemannian geometry underlying interior-point methods for linear programming. Contemp. Math. 114, 51–75 (1990)
Lauritzen, S.L.: Graphical Models, Oxford (1996)
Malley, J.D.: Statistical Applications of Jordan Algebras. Springer, Heidelberg (1994)
Morgera, S.D.: The role of abstract algebra in structured estimation theory. IEEE IT 38(3), 1053–1065 (1992)
Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)
Ohara, A.: Information geometric analysis of semidefinite programming problems. Proc. Inst. Stat. Math. 46(2), 317–334 (1998). in Japanese
Ohara, A., Ishi, H.: Doubly autoparallel structure on the probability simplex. In: Ay, N., Gibilisco, P., Matúš, F. (eds.) Information Geometry and Its Applications, vol. 252, pp. 323–334. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97798-0_12
Ohara, A., Suda, N., Amari, S.: Dualistic differential geometry of positive definite matrices and its applications to related problems. Linear Algorithm Appl. 247, 31–53 (1996)
Tanabe, K., Tsuchiya, T.: New geometry for linear programming. Math. Sci. 303, 32–37 (1988). in Japanese
Uohashi, K., Ohara, A.: Jordan algebra and dual affine connections on symmetric cones. Positivity 8, 369–378 (2004)
Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Theory, Algorithms, and Applications. Kluwer, Boston (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Ohara, A. (2019). Doubly Autoparallel Structure on Positive Definite Matrices and Its Applications. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2019. Lecture Notes in Computer Science(), vol 11712. Springer, Cham. https://doi.org/10.1007/978-3-030-26980-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-26980-7_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26979-1
Online ISBN: 978-3-030-26980-7
eBook Packages: Computer ScienceComputer Science (R0)