<p><a href="https://github.com/abhinvgpta" class="user-mention">@abhinvgpta</a>: Unfortunately not really. As I mentioned before this is an open ended project. I really should change the title to "investigate alternative methods for solving low rank SDPs". As I mentioned above, LR-SDP has its drawbacks. For problems like matrix completion, SGD seems to be a reasonable heuristic that works well in practice. Maybe that could be a first place to start.  </p>

<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">&mdash;<br />You are receiving this because you are subscribed to this thread.<br />Reply to this email directly or <a href="https://github.com/mlpack/mlpack/issues/395#issuecomment-202525027">view it on GitHub</a><img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFEnF0O9NbQYp4K8uDwXNO5JOcbKDks5pyCGGgaJpZM4DZ2uG.gif" width="1" /></p>
<div itemscope itemtype="http://schema.org/EmailMessage">
<div itemprop="action" itemscope itemtype="http://schema.org/ViewAction">
  <link itemprop="url" href="https://github.com/mlpack/mlpack/issues/395#issuecomment-202525027"></link>
  <meta itemprop="name" content="View Issue"></meta>
</div>
<meta itemprop="description" content="View this Issue on GitHub"></meta>
</div>