Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
From MaRDI portal
Publication:5230287
DOI10.1145/3188745.3188942zbMath1427.90213arXiv1804.01076OpenAlexW2964063683MaRDI QIDQ5230287
No author found.
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.01076
Related Items (15)
Information geometry of operator scaling ⋮ A Riemannian Corollary of Helly's Theorem ⋮ Fenchel Duality and a Separation Theorem on Hadamard Manifolds ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ An exponential lower bound for the degrees of invariants of cubic forms and tensor actions ⋮ Maximum likelihood estimation for tensor normal models via castling transforms ⋮ Unnamed Item ⋮ Interactions of computational complexity theory and mathematics ⋮ Unnamed Item ⋮ Algorithms for orbit closure separation for invariants and semi-invariants of matrices ⋮ Wildness for tensors ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling ⋮ Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
This page was built for publication: Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
