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

DOI10.1007/S41884-023-00116-XOpenAlexW4385361221MaRDI QIDQ6138812FDOQ6138812

Authors: Atsumi Ohara, Hideyuki Ishi, Takashi Tsuchiya

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

Recommendations

Doubly autoparallel structure on positive definite matrices and its applications
Doubly autoparallel structure on the probability simplex
Information Geometry and Interior-Point Algorithms
Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
Jordan algebras and dual affine connections on symmetric cones

zbMATH Keywords

interior point method Jordan algebra curvature integral structured covariance estimation doubly autoparallel structure

Mathematics Subject Classification ID

Interior-point methods (90C51)

Cites Work

Differential-geometrical methods in statistics
Title not available (Why is that?)
Covariance hypothesis which are linear in both the covariance and the inverse covariance
Title not available (Why is that?)
Title not available (Why is that?)
Model selection in the space of Gaussian models invariant by symmetry
The geometry of Hessian structures
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Title not available (Why is that?)
Title not available (Why is that?)
Handbook of semidefinite programming. Theory, algorithms, and applications
Linear systems in Jordan algebras and primal-dual interior-point algorithms
Dualistic differential geometry of positive definite matrices and its applications to related problems
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
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
Barrier Functions in Interior Point Methods
Asymptotically efficient estimation of covariance matrices with linear structure
Title not available (Why is that?)
The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
Curvature integrals and iteration complexities in SDP and symmetric cone programs
Title not available (Why is that?)
Title not available (Why is that?)
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
Quadratic Subspaces and Completeness
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Title not available (Why is that?)
Information geometry
The role of abstract algebra in structured estimation theory
Statistical submanifolds from a viewpoint of the Euler inequality
Statistical applications of Jordan algebras
Explicit solutions for interval semidefinite linear programs
Geodesics for dual connections and means on symmetric cones
A unified class of directly solvable semidefinite programming problems
The Simplest Semidefinite Programs are Trivial
Jordan algebras and dual affine connections on symmetric cones
Doubly autoparallel structure on the probability simplex
Title not available (Why is that?)
Toward differential geometry of statistical submanifolds

Cited In (1)

Fast symplectic integrator for Nesterov-type acceleration method

This page was built for publication: Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138812)