Hi everyone,
regarding if optimization on low-rank Hankel matrices could be addressed through Riemannian geometry (and thus Manopt).
The interest in this question arises because I'm solving a (convex relaxation) SDP problem of the type:
min <C,M>, s.t. M is Hankel and Positive Semidefinite
So here C is a symmetric nxn data matrix and M is a Positive Semidefinite
Hankel matrix.
The global solutions of interest turn to be low-rank and, because of this, I was considering to use
a Burer-Monteiro low-rank reformulation approach for scalability and the possible viability of doing this
through smooth optimization in a manifold, following the trend in Nicolas' work in the Riemannian Staircase
A quick characterization of a rank<p PSD Hankel matrix which comes to my mind is
M = YY', Y\in Re^{nxp},
with the constraints of the Hankel matrix written as
<B_i Y, Y> = 0,
and also considering this is a quotient space regarding orthogonal transformations Y~YO.
but this seems not to be trivial at all, so before putting more time into this I would like to know
your opinion (from previous knowledge or intuition) about the viability of this.
Actually, my main question is:
I can work towards checking the dimensionality of the tangent space derived
from the quadratic constraints (B_i matrices) arising above,
BUT then even if I am able to prove this is a smooth manifold (maybe not!)
I assume I still would need to find a retraction to perform the optimization in the Riemannian manifold.
That doesn't seem easy as well. A idea which comes to my mind to project ambient points
into the *manifold* (but I'm not sure if this is a retraction, so correct me if necessary!) would be solving:
min_M ||M - M0||, s.t. rank(M)<=p and M is Hankel
and then using the SVD decomposition of M to recover the appropriate Y point.
But, as I said, I don't know if this is promising at all as a possible retraction and,
most important, I've checking on some literature and this *structured low-rank approximation* problem
seems quite difficult per se, so I'm not sure if this is promising at all.
Well, as I said, this is a much more particular stuff but I would appreciate to hear
the opinion of those who have more experience on this before proceeding further :)
Best regards,
Jesus Briales