Answers are grounded in this paper and cite their sources.
Let H be a Hermitian m × m matrix, with eigenvalues λ ₁ λ ₂ ⋯ λ ₘ 0 of which m^ + 1 are positive. Then the maximum of ( Iₙ + GHG^ * ) over all complex n × m matrices G) satisfying trace GG^ * 1 is \[ r- r ( {1 + Σ i = 1^r λ _i- 1 } )^r Π j = 1^r λ _j , \] where r is the largest integer satisfying r n,r m^ +, and r< λ ᵣ ( 1 + Σ i = 1ʳ λ ᵢ- 1 ) . The matrices G for which the maximum is attained are characterized. They have rank r. A special case of this problem arises in the optimization of certain data communication systems.
No takes yet. Share an insight, caveat, or question.
H. S. Witsenhausen (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: