Optimization and Convexity of log det(I+KX−1)

  • Kwang-Ki K. KimEmail author
Technical Notes and Correspondence


This paper provides another proof for the convexity (strict convexity) of log det(I+KX-1) over the positive definite cone for any given positive semidefinite matrix K ⪰ 0 (positive definite matrix K ≻ 0) and the strict convexity of log det(K +X-1) over the positive definite cone for any given K ⪰ 0. Equivalent optimization representations with linear matrix inequalities (LMIs) for the functions log det(I+KX-1) and log det(K+X-1) are also presented. It was shown that these optimization representations with LMI constraints can be particularly useful for some related synthetic design problems. An iterative procedure based on the proposed LMI is presented to solve the minimax mutual information game with covariance and expected power constraints.


Coding theory convex optimization log-det function matrix differential minimax mutual information game positive definite matrix 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. N. Diggavi and T. M. Cover, “The worst additive noise under a covariance constraint,” IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 3072–3081, 2001.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    A. Kashyap, T. Basar, and R. Srikant, “Correlated jamming on mimo gaussian fading channels,” IEEE Transactions on Information Theory, vol. 50, no. 9, pp. 2119–2123, 2004.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    W. Mao, X. Su, and X. Xu, “Comments on ‘correlated jamming on mimo gaussian fading channels’,” IEEE Transactions on Information Theory, vol. 52, no. 11, pp. 5163–5165, 2006.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    Y.-H. Kim and S.-J. Kim, “On the convexity of log det(I+ KX1),” arXiv preprint cs/0611043, 2006.Google Scholar
  5. [5]
    S. Shafiee and S. Ulukus, “Mutual information games in multiuser channels with correlated jamming,” IEEE Transactions on Information Theory, vol. 55, no. 10, pp. 4598–4607, 2009.MathSciNetCrossRefzbMATHGoogle Scholar
  6. [6]
    S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004.CrossRefzbMATHGoogle Scholar
  7. [7]
    Y. Nesterov and A. Nemirovskii, Interior-point Polynomial Algorithms in Convex Programming, Society for Industrial and Applied Mathematics, 1994.CrossRefzbMATHGoogle Scholar
  8. [8]
    N. J. Higham, Accuracy and Stability of Numerical Algorithms, Society for Industrial and Applied Mathematics, 2002.Google Scholar
  9. [9]
    L. Vandenberghe, S. Boyd, and S.-P. Wu, “Determinant maximization with linear matrix inequality constraints,” SIAM Journal on Matrix Analysis and Applications, vol. 19, no. 2, pp. 499–533, 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    T. Tanaka, K.-K. K. Kim, P. A. Parrilo, and S. K. Mitter, “Semidefinite programming approach to Gaussian sequential rate-distortion trade-offs,” IEEE Transactions on Automatic Control, vol. 62, no. 4, pp. 1896–1910, 2017.MathSciNetCrossRefzbMATHGoogle Scholar
  11. [11]
    R. L. Dobrushin, “Optimum informtion transmission through a channel with unknown parameters,” Radio Eng. Electron., vol. 4, no. 12, pp. 1–8, 1959.Google Scholar
  12. [12]
    T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 2012.Google Scholar
  13. [13]
    S. Diamond and S. Boyd, “CVXPY: A Python-embedded modeling language for convex optimization,” Journal of Machine Learning Research, vol. 17, no. 83, pp. 1–5, 2016.MathSciNetzbMATHGoogle Scholar

Copyright information

© ICROS, KIEE and Springer 2019

Authors and Affiliations

  1. 1.Department of Electrical EngineeringInha UniversityIncheonKorea

Personalised recommendations