Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
From MaRDI portal
Publication:4993287
DOI10.4230/LIPIcs.ITCS.2018.24zbMath1462.90097arXiv1711.08039MaRDI QIDQ4993287
No author found.
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1711.08039
scalinginvariant theorytensorsgeometric complexity theoryalternating minimizationnull conequantum marginal problem
Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (14)
Counting matchings via capacity-preserving operators ⋮ Universal points in the asymptotic spectrum of tensors ⋮ 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 ⋮ Stability of the Levi-Civita tensors and an Alon-Tarsi type theorem ⋮ Weighted slice rank and a minimax correspondence to Strassen's spectra ⋮ Monochromatic equilateral triangles in the unit distance graph ⋮ Learning Paths from Signature Tensors ⋮ Unnamed Item ⋮ Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) ⋮ Unnamed Item ⋮ Generating random quantum channels ⋮ Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian kernels have only Gaussian maximizers
- Best constants in Young's inequality, its converse, and its generalization to more than three functions
- Computational invariant theory
- On vanishing of Kronecker coefficients
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
- Classical complexity and quantum entanglement
- Computation of dilated Kronecker coefficients
- Non-commutative Edmonds' problem and matrix semi-invariants
- Polynomial bounds for rings of invariants
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- Geometric complexity theory V: Efficient algorithms for Noether normalization
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
- Entanglement Polytopes: Multiparticle Entanglement from Single-Particle Information
- A Stratification of the Null Cone Via the Moment Map
- On the geometry of entangled states
- An elementary proof of the Hilbert-Mumford criterion
- On cap sets and the group-theoretic approach to matrix multiplication
- Membership in Moment Polytopes is in NP and coNP
- Equilibrium Points of Bimatrix Games
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Low-rank matrix completion using alternating minimization
- Functional Operators (AM-22), Volume 2
- Algorithms in invariant theory
This page was built for publication: Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
