Low rank matrix completion by alternating steepest descent methods

Date: 2016

Categories:

Reference

Tanner, J. and Wei, K. (2016) ‘Low rank matrix completion by alternating steepest descent methods’, Applied and Computational Harmonic Analysis, 40(2), pp. 417–429. doi: 10.1016/j.acha.2015.08.003.

Full text available at www.sciencedirect.com

Author

Dr. Mariarosaria Taddeo

« Information warfare: A philosophical perspective

CGIHT: Conjugate gradient iterative hard thresholding for compressed sensing and matrix completion »

Low rank matrix completion by alternating steepest descent methods

Reference

Author

More