Alternating direction method of multipliers for generalized low-rank tensor recovery
- Release time:2024-08-09
- Hits:
-
-
-
Affiliation of Author(s):
理学院
-
-
Journal:
Algorithms
-
-
-
Key Words:
中文关键字：低秩张量恢复；低秩矩阵恢复；核范数最小化，英文关键字：low-rank tensor recovery; low-rank matrix recovery
-
Abstract:
Low-Rank Tensor Recovery (LRTR), the higher order generalization of Low-Rank Matrix Recovery (LRMR), is especially suitable for analyzing multi-linear data with gross corruptions,outliers and missing values, and it attracts broad attention in the fields of computer vision, machine learning and data mining. This paper considers a generalized model of LRTR and attempts to recover
simultaneously the low-rank, the sparse, and the small disturbance components from partial entries of a given data tensor. Specifically, we first describe generalized LRTR as a tensor nuclear norm optimization problem that minimizes a weighted combination of the tensor nuclear norm, the l1 -norm and the Frobenius norm under linear constraints. Then, the technique of Alternating DirectionMethod of Multipliers (ADMM) is employed to solve the proposed minimization problem. Next, we discuss the weak convergence of the proposed iterative algorithm. Finally, experimental results on synthetic and real-world datasets validate the efficiency and effectiveness of the proposed method.
-
Note:
史加荣
-
-
First Author:
yangwei,zhengxiuyun,yinqingyan,shijiarong
-
Indexed by:
Journal paper
-
-
-
-
-
-
Volume:
卷：9
-
Issue:
期：2
-
Page Number:
页：28
-
-
-
Translation or Not:
no
-
-
Date of Publication:
2016-04-01
-
-
