Projects per year
Abstract
Matrix completion under interval uncertainty can be cast as a matrix completion problem with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions for an instance of collaborative filtering with 100,198,805 recommendations within 5 minutes on a single personal computer.
Original language | English |
---|---|
Pages (from-to) | 35-43 |
Number of pages | 28 |
Journal | European Journal of Operational Research |
Volume | 256 |
Issue number | 1 |
Early online date | 14 Jul 2016 |
DOIs | |
Publication status | Published - Jan 2017 |
Fingerprint
Dive into the research topics of 'Matrix Completion under Interval Uncertainty'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Science and Innovation: Numerical Algorithms and Intelligent Software for the Evolving HPC Platform
1/08/09 → 31/07/14
Project: Research