Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
From MaRDI portal
Publication:1746610
DOI10.1007/s00039-018-0434-2zbMath1387.68133arXiv1607.06711OpenAlexW2792881463MaRDI QIDQ1746610
Publication date: 25 April 2018
Published in: Geometric and Functional Analysis. GAFA, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.06711
Analysis of algorithms and problem complexity (68Q25) Numerical optimization and variational techniques (65K10) Inequalities for sums, series and integrals (26D15)
Related Items (27)
The Paulsen problem made simple ⋮ A Quiver Invariant Theoretic Approach to Radial Isotropy and the Paulsen Problem for Matrix Frames ⋮ Information geometry of operator scaling ⋮ Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory ⋮ An exponential lower bound for the degrees of invariants of cubic forms and tensor actions ⋮ Quantum Brascamp-Lieb dualities ⋮ Ranks of linear matrix pencils separate simultaneous similarity orbits ⋮ Inequality on the optimal constant of Young's convolution inequality for locally compact groups and their closed subgroups ⋮ Unnamed Item ⋮ On the nonlinear Brascamp-Lieb inequality ⋮ A symmetrization inequality shorn of symmetry ⋮ An algebraic Brascamp-Lieb inequality ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(L^p\)-improving estimates for Radon-like operators and the Kakeya-Brascamp-Lieb inequality ⋮ Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) ⋮ The regularity lemma is false over small fields ⋮ Operator scaling: theory and applications ⋮ Sinkhorn–Knopp theorem for rectangular positive maps ⋮ Matrix scaling and explicit doubly stochastic limits ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Edmonds' problem and the membership problem for orbit semigroups of quiver representations ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling ⋮ Sinkhorn-Knopp theorem for PPT states ⋮ Kakeya-Brascamp-Lieb inequalities ⋮ Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations ⋮ Polystability in positive characteristic and degree lower bounds for invariant rings
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of the main conjecture in Vinogradov's mean value theorem for degrees higher than three
- Nonnegative tensor factorization as an alternative Csiszar-Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms
- Geometric Brascamp-Lieb has the optimal best constant
- Some nonlinear Brascamp-Lieb inequalities and applications to harmonic analysis
- Gaussian kernels have only Gaussian maximizers
- Subadditivity of the entropy and its relation to Brascamp-Lieb type inequalities
- On a reverse form of the Brascamp-Lieb inequality
- Geometric algorithms and combinatorial optimization
- Completely positive linear maps on complex matrices
- Best constants in Young's inequality, its converse, and its generalization to more than three functions
- A linear lower bound on the unbounded error probabilistic communication complexity.
- Classical complexity and quantum entanglement
- The Brascamp-Lieb inequalities: Finiteness, structure and extremals
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Mean value estimates for Weyl sums in two dimensions
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
- The Brascamp–Lieb Polyhedron
- Rank bounds for design matrices with block entries and geometric applications
- Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
- Fractional Sylvester–Gallai theorems
- Rounding sum-of-squares relaxations
- Equilibrium Points of Bimatrix Games
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Behaviour of the Brascamp–Lieb constant
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- Low-rank matrix completion using alternating minimization
- Maximum matching and a polyhedron with 0,1-vertices
- Semi-invariants of quivers as determinants
- Semi-invariants of quivers for arbitrary dimension vectors
This page was built for publication: Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
