Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For positive semi-definite matrices $A,B$, how can I find an $X$ that minimizes $\text{Trace}(AX^TBX$) under the constraint:

that $X$ is orthogonal.

All the matrices have real entries and $A,B$ are square while $X$ is rectangular. Thanks.

This is what I have:

Define $B=F^{T}F$. Define $Y=FX$. You get the above problem as \begin{align} \min_{Y}~ \text{trace}(AY^{T}Y) \end{align}

But now I want $X^*$ that minimizes the original problem. This is what is confusing me!

share|cite|improve this question
If you observe that $A = G^\top G$, and then apply the cyclic invariance property of the trace, you get a minimization of trace$(Z^T Z) = \|Z \|_F^2$ where $Z = F X G^\top$. That should simplify things somewhat, especially since $F$ and $G$ are products of orthogonal matrices with a diagonal matrix. – Suresh Venkat Nov 19 '12 at 16:22

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.