基质(化学分析)
低秩近似
秩(图论)
矩阵完成
流离失所(心理学)
数学
矩阵分解
增广矩阵
非负矩阵
矩阵范数
方阵
分块矩阵
矩阵法
稀疏矩阵
作者
Damiana Lazzaro,Serena Morigi
出处
期刊:Electronic Transactions on Numerical Analysis
[Verlag der Osterreichischen Akademie der Wissenschaften]
日期:2020-01-01
被引量:1
标识
DOI:10.1553/etna_vol53s481
摘要
The matrix completion problem consists in the recovery of a low-rank or approximately low-rank matrix from a sampling of its entries. The solution rank is typically unknown, and this makes the problem even more challenging. However, for a broad class of interesting matrices with so-called displacement structure, the originally ill-posed completion problem can find an acceptable solution by exploiting the knowledge of the associated displacement rank. The goal of this paper is to propose a variational non-convex formulation for the low-rank matrix completion problem with low-rank displacement and to apply it to important classes of medium-large scale structured matrices. Experimental results show the effectiveness and efficiency of the proposed approach for Toeplitz and Hankel matrix completion problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI