Convexity of the image of a quadratic map via the relative entropy distance

DOI10.1007/s13366-013-0187-xzbMath1312.52005arXiv1305.0243OpenAlexW2962694033MaRDI QIDQ464812

Alexander I. Barvinok

Publication date: 30 October 2014

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0243

zbMATH Keywords

relative entropyMarkov inequalityGaussian measureKullback-Leibler distanceapproximate Carathéodory theoremJohnson-Lindenstrauss lemmapositive semidefinite programmingquadratic convexity

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Statistical aspects of information-theoretic topics (62B10) Approximation by convex sets (52A27)

Related Items (1)

Elliptic quadratic operator equations

Cites Work

• Unnamed Item
• Unnamed Item
• Polyhedral and semidefinite programming methods in combinatorial optimization
• A Unified Theorem on SDP Rank Reduction
• On variants of the Johnson–Lindenstrauss lemma
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
• Elements of Information Theory
• A Survey of the S-Lemma

This page was built for publication: Convexity of the image of a quadratic map via the relative entropy distance