Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
The authors propose a self-concordant barrier for the so-called quantum or von Neumann entropy which is the function \(\text{Tr}(X\, \text{Ln}(X))\) where \(X\) is a positive semi-definite complex Hermitian matrix. This result opens the way for including many optimization problems (arising, e.g., in quantum information theory, quantum statistical physics, information geometry) into a general interior point polynomial framework. The authors consider a broad class of functions, namely, primitives of matrix monotone functions on positive semi-axis. It turns out that the standard \(\ln \det\) barrier is compatible (in the sense of the theory of self-concordant functions) with functions from this class. The authors also establish the self-concordance of associated barriers (along with barrier parameter estimate) on the epigraphs of functions of this class.
- Spectral self-concordant functions in the space of two-by-two symmetric matrices
- Strong convexity of sandwiched entropies and related optimization problems
- Semidefinite approximations of the matrix logarithm
- Monotonicity versions of Epstein's Concavity Theorem and related inequalities
- Separable self-concordant spectral functions and a conjecture of Tunçel
- E. Lieb convexity inequalities and noncommutative Bernstein inequality in Jordan-algebraic setting
- Euclidean Jordan algebras and interior-point algorithms
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Introduction to matrix analysis and applications
- Introductory lectures on convex optimization. A basic course.
- Monotone functions on formally real Jordan algebras
- On a commutative class of search directions for linear programming over symmetric cones
- Relative entropy optimization and its applications
- Separable self-concordant spectral functions and a conjecture of Tunçel
- Several Jordan-algebraic aspects of optimization†
- Semidefinite approximations of the matrix logarithm
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
- Primal-dual interior-point methods for domain-driven formulations
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Self-concordance and matrix monotonicity with applications to quantum entanglement problems
- Interior point methods for structured quantum relative entropy optimization problems
This page was built for publication: Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686542)
