Abstract
Let g be a continuously differentiable function whose derivative is matrix monotone on the positive semi-axis. Such a function induces a function \(\varphi (x)=\mathrm{tr}\, \big (g(x)\big )\) on the cone of squares of an arbitrary Euclidean Jordan algebra. We show that \(\varphi (x) - \ln \det (x)\) is a self-concordant function on the interior of the cone. We also show that \( -\ln (t-\varphi (x))-\ln \det (x)\) is \((r+1)\)-self-concordant barrier on the epigraph of \(\varphi ,\) where r is the rank of the Jordan algebra. The case \(\phi (x)=\mathrm{tr(x\ln x)}\) is discussed in detail.
Similar content being viewed by others
References
Chandrasecaran, V., Shah, P.: Relative entropy optimization and its applications. Math. Program. Ser. A 161(1–2), 1–32 (2017)
Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Cambridge University Press, Cambridge (1994)
Faybusovich, L.: Jordan algebras and interior-point algorithms. Positivity 1(4), 331–357 (1997)
Faybusovich, L.: E. Lieb convexity inequalities and noncommutative Bernstein inequality in Jordan-algebraic setting. Theor. Math. Appl. 6(2), 1–35 (2016)
Faybusovich, L.: Several Jordan-algebraic aspects of optimization. Optimization 57(3), 379–393 (2008)
Hiai, F., Petz, D.: Introduction to Matrix Analysis and Applications. Springer, New York (2014)
Kakihara, S., Ohara, A., Tsuchiya, T.: Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs. J. Optim. Theory Appl. 157(3), 749–780 (2013)
Korányi, A.: Monotone functions on formally real Jordan algebras. Math. Ann. 269(1), 73–76 (1984)
Muramatsu, M.: On a commutative class of search directions for linear programming over symmetric cones. J. Optim. Theory Appl. 112(3), 595–625 (2002)
Nesterov, Yu., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)
Nesterov, Yu.: Introductory Lectures on Convex Optimization. Kluwer, Boston (2004)
Peña, J., Sendov, H.: Separable self-concordant spectral functions and a conjecture of Tunçel. Math. Program. Ser. A 125(1), 101–122 (2010)
Acknowledgements
The first author is supported in part by Simmons Foundation Grant 275013. The second author is supported in part with Grant-in-Aid for Scientific Research (B), 24310112 from the Japan Society for the Promotion of Sciences.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Faybusovich, L., Tsuchiya, T. Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems. Optim Lett 11, 1513–1526 (2017). https://doi.org/10.1007/s11590-017-1145-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-017-1145-6