摘要
本文提出加权的Schatten-1/2拟范数求解低秩矩阵近似问题,该模型以加权的Schatten-1/2拟范数为目标函数,观测矩阵为约束。通过基于阈值的加权不动点迭代算法求解。该方法通过分配不同权值体现奇异值的重要性可更好地近似原来的低秩假设。另一方面,针对奇异值计算量大的问题引入约化奇异值分解。数值实验结果表明,该方法具有较快的收敛速度。
In this paper, the low-rank matrix approximation problem is discussed with a weighted Schatten quasi-norm as the objective function, constrained by partial obtained data. The weights are in-troduced to measure the importance of different rank components. A weighted fixed point iterative thresholding algorithm is proposed based on the fixed point representation theory. The con-vergence analysis of the algorithm is provided. Numerical examples illustrate the effciency of our method.
出处
《理论数学》
2021年第6期998-1009,共12页
Pure Mathematics
