# Low-rank optimization for distance matrix completion

@article{Mishra2011LowrankOF, title={Low-rank optimization for distance matrix completion}, author={Bamdev Mishra and Gilles Meyer and Rodolphe Sepulchre}, journal={IEEE Conference on Decision and Control and European Control Conference}, year={2011}, pages={4455-4460} }

- Published 2011 in IEEE Conference on Decision and Control and…
DOI:10.1109/CDC.2011.6160810

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix… CONTINUE READING

Recent Discussions

This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS