Semidefinite approximations of the matrix logarithm

DOI10.1007/S10208-018-9385-0zbMath1411.90254arXiv1705.00812OpenAlexW2611807022WikidataQ130094834 ScholiaQ130094834MaRDI QIDQ1740571

James Saunderson, Pablo A. Parrilo, Hamza Fawzi

Publication date: 30 April 2019

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationquantum relative entropymatrix concavity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear operator inequalities (47A63) Convex functions and convex programs in convex geometry (52A41)

Related Items (9)

Information geometry of operator scaling ⋮ Long-step path-following algorithm for quantum information theory: some numerical aspects and applications ⋮ A new perspective on low-rank optimization ⋮ Optimal Self-Concordant Barriers for Quantum Relative Entropies ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Entropy constraints for ground energy optimization ⋮ Quantum theory in finite dimension cannot explain every general process with finite memory ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations ⋮ Geometric Rényi divergence and its applications in quantum channel capacities

Uses Software

• CVX
• Mosek
• ECOS
• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
• Non-commutative perspectives
• Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
• A tutorial on geometric programming
• Jensen's inequality for operators and Loewner's theorem
• Hilbert's metric and positive contraction mappings in a Banach space
• A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
• On the semidefinite representation of real functions applied to symmetric matrices
• Convex trace functions and the Wigner-Yanase-Dyson conjecture
• The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
• Lectures on Modern Convex Optimization
• A matrix convexity approach to some celebrated quantum inequalities
• Improved Inverse Scaling and Squaring Algorithms for the Matrix Logarithm
• Efficient optimization of the quantum relative entropy
• Condition Estimates for Matrix Functions
• Computational Techniques for Real Logarithms of Matrices
• Semidefinite Optimization and Convex Algebraic Geometry
• Perspectives of matrix convex functions
• Successive iterations and logarithmic means
• From joint convexity of quantum relative entropy to a concavity theorem of Lieb
• Is Gauss Quadrature Better than Clenshaw–Curtis?
• Functions of Matrices
• An Introduction to Matrix Concentration Inequalities
• An Algorithm for Computing Logarithms and Arctangents
• On Polyhedral Approximations of the Second-Order Cone

This page was built for publication: Semidefinite approximations of the matrix logarithm