Semidefinite approximations of the matrix logarithm
From MaRDI portal
Publication:1740571
Abstract: The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix functions, many of which are of importance in quantum information theory. In this paper we show how to approximate the matrix logarithm with functions that preserve operator concavity and can be described using the feasible regions of semidefinite optimization problems of fairly small size. Such approximations allow us to use off-the-shelf semidefinite optimization solvers for convex optimization problems involving the matrix logarithm and related functions, such as the quantum relative entropy. The basic ingredients of our approach apply, beyond the matrix logarithm, to functions that are operator concave and operator monotone. As such, we introduce strategies for constructing semidefinite approximations that we expect will be useful, more generally, for studying the approximation power of functions with small semidefinite representations.
Recommendations
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- On the semidefinite representation of real functions applied to symmetric matrices
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- Approximating optimization problems over convex functions
- Approximation schemes for functions of positive-definite matrix values
Cites work
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- A matrix convexity approach to some celebrated quantum inequalities
- A tutorial on geometric programming
- An Algorithm for Computing Logarithms and Arctangents
- An introduction to matrix concentration inequalities
- Approximation theory and approximation practice
- Computational Techniques for Real Logarithms of Matrices
- Condition Estimates for Matrix Functions
- Convex trace functions and the Wigner-Yanase-Dyson conjecture
- Efficient optimization of the quantum relative entropy
- Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
- From joint convexity of quantum relative entropy to a concavity theorem of Lieb
- Functions of Matrices
- Hilbert's metric and positive contraction mappings in a Banach space
- scientific article; zbMATH DE number 5131267 (Why is no real title available?)
- scientific article; zbMATH DE number 4146872 (Why is no real title available?)
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Improved inverse scaling and squaring algorithms for the matrix logarithm
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Jensen's inequality for operators and Loewner's theorem
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- Non-commutative perspectives
- On Polyhedral Approximations of the Second-Order Cone
- On the semidefinite representation of real functions applied to symmetric matrices
- Perspectives of matrix convex functions
- Semidefinite Optimization and Convex Algebraic Geometry
- Successive iterations and logarithmic means
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- Trace inequalities and quantum entropy: an introductory course
Cited in
(23)- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- Geometric Rényi divergence and its applications in quantum channel capacities
- Information geometry of operator scaling
- On the semidefinite representation of real functions applied to symmetric matrices
- Long-step path-following algorithm for quantum information theory: some numerical aspects and applications
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- Padé error estimates for the logarithm of a matrix
- Approximate Semidefinite Matrices in a Linear Variety
- Primal-dual interior-point methods for domain-driven formulations
- On ㏒ majorizations for positive semidefinite matrices
- 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
- Weighted geometric mean, minimum mediated set, and optimal simple second-order cone representation
- Semi-definite programming and quantum information
- Thermal bootstrap of matrix quantum mechanics
- Self-concordance and matrix monotonicity with applications to quantum entanglement problems
- Additivity of quantum relative entropies as a single-copy criterion
- Interior point methods for structured quantum relative entropy optimization problems
- A conditional gradient homotopy method with applications to semidefinite programming
- Chebyshev approximation of log-determinants of spatial weight matrices
This page was built for publication: Semidefinite approximations of the matrix logarithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740571)
