Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/4E29216F-7959-40E5-A83D-F3730C1C47D6 | ||
| Year | 2018 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | G. Lourakis and A. P. Liavas, "Nesterov-based alternating optimization for nonnegative tensor completion: algorithm and parallel implementation," in IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications, 2018. doi: 10.1109/SPAWC.2018.8445941 https://doi.org/10.1109/SPAWC.2018.8445941 | ||
| Appears in Collections |
We consider the problem of nonnegative tensor completion. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization framework and solve each nonnegative matrix completion problem via a Nesterov-type algorithm for smooth convex problems. We describe a parallel implementation of the algorithm and measure the attained speedup in a multi-core computing environment. It turns out that the derived algorithm is an efficient candidate for the solution of very large-scale sparse nonnegative tensor completion problems.
Copyright © DIAS 2013
