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

DOI10.1007/s11590-017-1145-6zbMath1394.90529OpenAlexW2607314934MaRDI QIDQ1686542

Takashi Tsuchiya, Leonid Faybusovich

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)

Related Items

Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions, Optimal Self-Concordant Barriers for Quantum Relative Entropies, Primal-Dual Interior-Point Methods for Domain-Driven Formulations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
• Relative entropy optimization and its applications
• Monotone functions on formally real Jordan algebras
• Euclidean Jordan algebras and interior-point algorithms
• Introductory lectures on convex optimization. A basic course.
• On a commutative class of search directions for linear programming over symmetric cones
• Separable self-concordant spectral functions and a conjecture of Tunçel
• Several Jordan-algebraic aspects of optimization†
• Introduction to matrix analysis and applications