Lieb's concavity theorem, matrix geometric means, and semidefinite optimization

DOI10.1016/J.LAA.2016.10.012MaRDI QIDQ344905zbMATH OpenOpenAlexFDO

Authors Hamza Fawzi, James Saunderson

Publication date 25 November 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

linear matrix inequalitiessemidefinite optimizationmatrix convexityLieb's concavity theoremmatrix geometric means

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear operator inequalities (47A63) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: A famous result of Lieb establishes that the map $(A,B)mapstoexttrleft[K^{\ast }{A}^{1-t}K{B}^{t}ight]$ is jointly concave in the pair $(A,B)$ of positive definite matrices, where $K$ is a fixed matrix and $tin[0,1]$. In this paper we show that Lieb's function admits an explicit semidefinite programming formulation for any rational $tin[0,1]$. Our construction makes use of a semidefinite formulation of weighted matrix geometric means. We provide an implementation of our constructions in Matlab.

Recommendations

• On the semidefinite representation of real functions applied to symmetric matrices
• Semidefinite approximations of the matrix logarithm
• The simplest proof of Lieb concavity theorem
• Extensions of Lieb's concavity theorem
• Multivariate extensions of Lieb's concavity theorem

Cites work

• A Minkowski type trace inequality and strong subadditivity of quantum entropy. II: Convexity and concavity
• Computing quantum discord is NP-complete
• Convex trace functions and the Wigner-Yanase-Dyson conjecture
• Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
• Free semidefinite representation of matrix power functions
• Fundamental properties of Tsallis relative entropy
• Graph implementations for nonsmooth convex programs
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Means of positive linear operators
• Monotonic decrease of the quantum nonadditive divergence by projective measurements
• Monotonicity of a relative Rényi entropy
• On quantum Rényi entropies: a new generalization and some properties
• On the semidefinite representation of real functions applied to symmetric matrices
• Positive Definite Matrices
• Possible generalization of Boltzmann-Gibbs statistics.
• Quantum information processing with finite resources. Mathematical foundations
• Quantum proofs
• Relative entropy relaxations for signomial optimization
• Remarks on two theorems of E. Lieb
• Separability Criterion for Density Matrices
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• The simplest proof of Lieb concavity theorem
• Trace inequalities and quantum entropy: an introductory course
• Weighted means and Karcher equations of positive operators

Cited in

(11)

• Semidefinite approximations of the matrix logarithm
• On the semidefinite representation of real functions applied to symmetric matrices
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
• Geometric Rényi divergence and its applications in quantum channel capacities
• On variational expressions for quantum relative entropies
• A note on majorization properties of the Lieb function
• Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
• Efficient optimization of the quantum relative entropy
• A new perspective on low-rank optimization
• SONC optimization and exact nonnegativity certificates via second-order cone programming
• Semi-definite programming and quantum information

Describes a project that uses

Uses Software

• Matlab
• CVX
• Mosek

This page was built for publication: Lieb's concavity theorem, matrix geometric means, and semidefinite optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344905)