Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems

DOI10.1007/S11590-017-1145-6MaRDI QIDQ1686542zbMATHOpenAlexFDO

Authors L. Faybusovich, Takashi Tsuchiya

Publication date 15 December 2017

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-017-1145-6

zbMATH Keywords

quantum entropyself-concordancematrix monotonicity

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• 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

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• E. Lieb convexity inequalities and noncommutative Bernstein inequality in Jordan-algebraic setting
• Euclidean Jordan algebras and interior-point algorithms
• 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†

Cited in

(4)

• Semidefinite approximations of the matrix logarithm
• Primal-dual interior-point methods for domain-driven formulations
• Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
• Optimal Self-Concordant Barriers for Quantum Relative Entropies

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)