Rank-one matrix completion is solved by the sum-of-squares relaxation of order two

Augustin Cosse, Laurent Demanet. Rank-one matrix completion is solved by the sum-of-squares relaxation of order two. In 6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015, Cancun, Mexico, December 13-16, 2015. pages 9-12, IEEE, 2015. [doi]

Authors

Augustin Cosse

This author has not been identified. Look up 'Augustin Cosse' in Google

Laurent Demanet

This author has not been identified. Look up 'Laurent Demanet' in Google