Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/4E29216F-7959-40E5-A83D-F3730C1C47D6 | - |
| Αναγνωριστικό | https://doi.org/10.1109/SPAWC.2018.8445941 | - |
| Αναγνωριστικό | https://ieeexplore.ieee.org/document/8445941 | - |
| Γλώσσα | en | - |
| Μέγεθος | 5 pages | en |
| Τίτλος | Nesterov-based alternating optimization for nonnegative tensor completion: algorithm and parallel implementation | en |
| Δημιουργός | Lourakis Georgios | en |
| Δημιουργός | Λουρακης Γεωργιος | el |
| Δημιουργός | Liavas Athanasios | en |
| Δημιουργός | Λιαβας Αθανασιος | el |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περίληψη | 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. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2019-06-06 | - |
| Ημερομηνία Δημοσίευσης | 2018 | - |
| Θεματική Κατηγορία | Nonnegative tensor completion | en |
| Θεματική Κατηγορία | Optimal first-order optimization algorithms | en |
| Θεματική Κατηγορία | Parallel algorithms | en |
| Θεματική Κατηγορία | Tensors | en |
| Βιβλιογραφική Αναφορά | 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 | en |
Copyright © DIAS 2013
