An inexact continuation accelerated proximal gradient algorithm for low n-rank tensor recovery
The low n-rank tensor recovery problem is an interesting extension of the compressed sensing. This problem consists of finding a tensor of minimum n-rank subject to linear equality constraints and has been proposed in many areas such as data mining, machine learning and computer vision. In this pape...
Uložené v:
| Vydané v: | International journal of computer mathematics Ročník 91; číslo 7; s. 1574 - 1592 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Abingdon
Taylor & Francis
03.07.2014
Taylor & Francis Ltd |
| Predmet: | |
| ISSN: | 0020-7160, 1029-0265 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!