Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs
From MaRDI portal
Publication:6138812
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
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4047920 (Why is no real title available?)
- scientific article; zbMATH DE number 4047921 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1047675 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- scientific article; zbMATH DE number 1390210 (Why is no real title available?)
- scientific article; zbMATH DE number 3418508 (Why is no real title available?)
- 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
- A unified class of directly solvable semidefinite programming problems
- Asymptotically efficient estimation of covariance matrices with linear structure
- Barrier Functions in Interior Point Methods
- Covariance hypothesis which are linear in both the covariance and the inverse covariance
- Curvature integrals and iteration complexities in SDP and symmetric cone programs
- 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
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- Explicit solutions for interval semidefinite linear programs
- Geodesics for dual connections and means on symmetric cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Information geometry
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Jordan algebras and dual affine connections on symmetric cones
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Model selection in the space of Gaussian models invariant by symmetry
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Quadratic Subspaces and Completeness
- Statistical applications of Jordan algebras
- Statistical submanifolds from a viewpoint of the Euler inequality
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- 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 Simplest Semidefinite Programs are Trivial
- The geometry of Hessian structures
- The role of abstract algebra in structured estimation theory
- Toward differential geometry of statistical submanifolds
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)
