Semidefinite Approximations of the Matrix Logarithm
Foundations of Computational Mathematics
MetadataShow full item record
Fawzi, H., Saunderson, J., & Parrilo, P. (2019). Semidefinite Approximations of the Matrix Logarithm. Foundations of Computational Mathematics, 19 (2), 259-296. https://doi.org/10.1007/s10208-018-9385-0
© 2018, SFoCM. 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.
External DOI: https://doi.org/10.1007/s10208-018-9385-0
This record's URL: https://www.repository.cam.ac.uk/handle/1810/279374