Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs

DOI10.1007/s41884-023-00116-xOpenAlexW4385361221MaRDI QIDQ6138812

Atsumi Ohara, Takashi Tsuchiya, Hideyuki Ishi

Publication date: 16 January 2024

Published in: Information Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41884-023-00116-x

zbMATH Keywords

interior point methodJordan algebracurvature integralstructured covariance estimationdoubly autoparallel structure

Mathematics Subject Classification ID

Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model selection in the space of Gaussian models invariant by symmetry
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
• Curvature integrals and iteration complexities in SDP and symmetric cone programs
• A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
• Covariance hypothesis which are linear in both the covariance and the inverse covariance
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• Asymptotically efficient estimation of covariance matrices with linear structure
• The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
• Statistical applications of Jordan algebras
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Geodesics for dual connections and means on symmetric cones
• A unified class of directly solvable semidefinite programming problems
• Jordan algebras and dual affine connections on symmetric cones
• Explicit solutions for interval semidefinite linear programs
• Statistical submanifolds from a viewpoint of the Euler inequality
• Differential-geometrical methods in statistics
• Doubly autoparallel structure on the probability simplex
• Dualistic differential geometry of positive definite matrices and its applications to related problems
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• The role of abstract algebra in structured estimation theory
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Barrier Functions in Interior Point Methods
• The Simplest Semidefinite Programs are Trivial
• Information Geometry
• Quadratic Subspaces and Completeness
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Toward differential geometry of statistical submanifolds