Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
From MaRDI portal
Publication:1686542
DOI10.1007/S11590-017-1145-6zbMATH Open1394.90529OpenAlexW2607314934MaRDI QIDQ1686542FDOQ1686542
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
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
- Title not available (Why is that?)
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- Introduction to matrix analysis and applications
- Euclidean Jordan algebras and interior-point algorithms
- On a commutative class of search directions for linear programming over symmetric cones
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
- Monotone functions on formally real Jordan algebras
- Relative entropy optimization and its applications
- Several Jordan-algebraic aspects of optimization†
- Separable self-concordant spectral functions and a conjecture of Tunçel
- Title not available (Why is that?)
Cited In (3)
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)
