Thanks a lot
Roy
And etr(.) is the exponential trace function etr(.) = exp( trace(.) ).
Please correct me if I'm wrong.
1. Are you dealing with real matrices?
2. It is enough to deal with X'X instead of X
3. X'X is a symmetric and regular matrix
4. Since it is symmetrix, it is diagonalisable with an orthonormal
similarity transformation
5. In fact, what you have is an optimisation problem of N variables:
D = Diag(x1,...,xn)
f = det(D)^{-m/2} + etr (Y D^{-1} Y')
I suggest you to apply derivatives then to find the optimum.
BR, Tamas
If B = Y'*Y and X'*X = c*I for positive c c then
f = 1/pow( c, m*dim/2) + exp( Tr(B)/c)
As c->0 f->+inf
Duncan
Not quite: if X'X = U D U', then
etr(Y (X'X)^(-1) Y') = etr(Y U D^(-1) U' Y')
and the dependence on U can't be removed.
Robert Israel isr...@math.ubc.ca
Department of Mathematics http://www.math.ubc.ca/~israel
University of British Columbia Vancouver, BC, Canada
The second term is nonnegative, but the first term can be arbitrarily
large. So f is unbounded, and there is no maximum.
Ooops, I am really sorry I made a big typing mistake. The function
should be
f = det(X'X)^{-m/2} * etr ( -Y (X'X)^{-1} Y').
Both X and Y are real matrices. X has full column rank. So is this
function has a maximum?
Thanks
Roy
>Ooops, I am really sorry I made a big typing mistake. The function
>should be
>f = det(X'X)^{-m/2} * etr ( -Y (X'X)^{-1} Y').
>Both X and Y are real matrices. X has full column rank. So is this
>function has a maximum?
Take logarithms, noting that det(A) = etr(ln(A)) for
positive-definite matrices A. Writing Z = (X'X)^(-1), we have
ln f = m/2 tr(ln(Z)) - tr(Y Z Y')
If Y is invertible, this should have a maximum. But if not, it
isn't: if x is any vector with Y x = 0, let Z be a positive-definite
matrix for which x is an eigenvector with eigenvalue t. Then as
t increases (with the other eigenvalues staying fixed) the second
term does not change, while the first term goes to infinity.
How do you define ln(A)? natural log of each element of A?
If it is true, then etr(ln(A)) is the product of the diagonal elements
of A.
det(A) is the product of all eigenvalues (characteristic roots) of A.
How could these two be the same?
>
> ln f = m/2 tr(ln(Z)) - tr(Y Z Y')
>
> If Y is invertible, this should have a maximum.
Do you mean Y should have full column rank?
No, it's using the functional calculus. Explicitly, if A (which in
this case is positive definite) can be diagonalized as A = U D U',
where U is orthogonal and D is diagonal, then ln(A) = U C U'
where C is diagonal with diagonal entries C_{ii} = ln(D_{ii}).
Oh, thank you for reminding me of this. I am not good at matrix
calculus at all. So if Y is invertible, how to solve the maximum
problem:
ln f = m/2 tr(ln(Z)) - tr(Y Z Y')
Any hints?
Write f = (det Z)^(m/2) etr(-Y Z Y').
Let Z = Y^(-1) R (Y')^(-1). Then
f = det(Y)^(-m) det(R)^(m/2) etr(-R), so we need to maximize
det(R)^(m/2) etr(-R) over positive-definite matrices R.
Now if R has eigenvalues lambda_j (counted by multiplicity)
det(R)^(m/2) etr(-R) = product_j lambda_j^(m/2) exp(-lambda_j).
The function g(z) = z^(m/2) exp(-z) has its maximum for z >= 0
at z = m/2, so the maximum of f is attained when all
lambda_j = m/2. Thus we can take R = m/2 I,
Z = m/2 Y^(-1)(Y')^(-1) = m/2 (Y' Y)^(-1),
and since I defined Z = (X' X)^(-1), we may as well take
X = sqrt(2/m) Y.
Thank you very much! This is very neat. All I want to say is Math is
beautiful!
I have a follow-up question. What if some columns of X is already
known and fixed, and some others are unknown? In that case, we want to
find the value of those unknowns to maximize the function.
Roy