Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
Authors:
- 10 February 2018
- journal article
- research article
- Published by Springer Nature in Geometric and Functional Analysis
- Vol. 28 (1) , 100-145
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Nonnegative tensor factorization as an alternative Csiszar–Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithmsData Mining and Knowledge Discovery, 2010
- The Brascamp–Lieb PolyhedronCanadian Journal of Mathematics, 2010
- Classical complexity and quantum entanglementJournal of Computer and System Sciences, 2004
- A linear lower bound on the unbounded error probabilistic communication complexityJournal of Computer and System Sciences, 2002
- Semi-invariants of quivers as determinantsTransformation Groups, 2001
- Semi-invariants of quivers for arbitrary dimension vectorsIndagationes Mathematicae, 2001
- Gaussian kernels have only Gaussian maximizersInventiones Mathematicae, 1990
- Best constants in Young's inequality, its converse, and its generalization to more than three functionsAdvances in Mathematics, 1976
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic MatricesThe Annals of Mathematical Statistics, 1964