Hello there,
I have observed for my problem that TrustRegions with manopt converges to the same solution irrespective of the initial point. My conjecture is that my objective function is (geodesically?) convex, but I don't yet have the background knowledge to prove this. If there is anybody in this community who has familiarity with my problem, could you please point me to some relevant references?
I am hoping a description at this level of generality suffices to capture my problem.
Let A and B denote symmetric positive definite matrices of size d by d, and let C=A-B+2*I, where I is the identity matrix. We also define Cinv to be the inverse of C, assumed to exist. I would like to find Vr in Grassman(d,r) which maximizes
objective(Vr) = trace(Vr.T*B*Vr) - logdet(Vr.T*Cinv*Vr).
Using Lagrange multipliers and some algebraic manipulation, I obtain the following necessary and sufficient conditions for Vr to be a critical point:
(i) Vr.T*[A, B]*Vr = [Vr.T*A*Vr, Vr.T*B*Vr] where [A,B] = A*B-B*A is the matrix commutator, and
(ii) Vp.T*(A+B+A*B-B*B)*Vr = Vp.T*(A-B)*Vr*Vr.T*B*Vr, where Vp denotes any orthogonal complement to Vr.
I'm struggling to analytically determine feasible points of this, let alone show that only one exists. (Note that any r eigenvectors of A or B satisfies (i), but not necessarily (ii)).
My hope is that a more direct argument using geodesic convexity exists. (Or, if I am allowed to dream, that a direct analytical solution exists!)
Thank you in advance for your help,
Matt