王俊霞, 王川龙, 申倩影
王俊霞, 王川龙, 申倩影. 矩阵填充硬阈值算法的两种修正[J]. 数值计算与计算机应用, 2021, 42(2): 126-133.
Wang Junxia, Wang Chuanlong, Shen Qianying. TWO MODIFIED ALGORITHMS FOR MATRIX COMPLETION USING HARD-THERESHODING ALGORITHM[J]. Journal on Numerica Methods and Computer Applications, 2021, 42(2): 126-133.
Wang Junxia, Wang Chuanlong, Shen Qianying
MR(2010)主题分类:
分享此文:
[1] Bertalmio M, Sapiro G, Caselles V, et al. Image inpaiting[C]. Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, New York, ACM, 2000: 417–424. [2] Tomasi C, Kanade T. Shape and motion from image streams under orthography: A factorization method[J]. Int J Comput Math Vision, 1992, 9: 137–154. [3] Amit Y, Fink M, Srebro N, et al. Uncovering shared structures in multiclass classification[C]. Processings of the 24th International Conference on Machine Learing, New York, ACM, 2007: 17–24. [4] Argyriou A, Evgeniou T. Mul-task feature learning[J]. Adv Neural Inf Process Syst, 2007, 19: 41–48. [5] Beus H L. The Use of Information in Sorting[J]. ACM, 1970, 17(3): 482–495. [6] M.Y.Yun. Design and Analysis of Predictive Sorting Algorithms[J]. Korean J.Comp. and Appl. Math, 1996, 3(1): 22–24. [7] Blumensath T, Davies ME. Iterative thresholding for sparse approximation[J]. J Fourier Anal Appl 2008, 14: 629–654. [8] Absil P A, Baker C G and Gallivan K A. Trust-Region Methods on Riemannian Manifolds[J]. 2001, 7(3): 303–330. [9] Absil P A, Mahony R and Sepulchre R. Riemannian geometry of Grassmann manifolds with a view on algorithmic computation[J]. Acta Appl. Math. 2004(2): 199–220. [10] Absil P A, Baker C G and Gallivan K A. Trust-region methods on Riemannian manifolds with applications in numerical linear algebra[C]. Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems (MTNS2004), Leuven, Belgium, 2004: 5–9. [11] Birkhof G., Varga R. Implicit alternating direction methods[J]. Transactions of the American Mathematical Society, 1959, 92(1): 13–24. [12] Blumensath T, Davies M E. Iterative thresholding for sparse approximations[J]. Journal of Fourier Analysis Applications, 2008, 14(5): 629–654. [13] Portilla J. Image restoration through l0 analysis-based sparse optimization in tight frames[C]. IEEE International Conference on Image Processing, 2009: 3909–3912. [14] Blumensath T. Accelerated iterative hard thresholding[J]. Signal Processing, 2012, 92(3): 752–756. [15] Goldfarb D, Ma S. Convergence of fixed point continuation algorithms for matrix rank minimization[J]. Foudations of Computational Mathematics, 2011,11(2): 183–210. [16] Zhang M, Yang L, Huang Z H. Minimum n-rank approximation via iterative hard thresholding[J]. Applied Mathematics and Computation, 2015, (256): 860–875. [17] 张雁峰, 范西岸, 尹志益等. 基于回溯的共轭梯度迭代硬阈值重构算法[J]. 计算机应用, 2018, 38(12): 3580–3583. |
[1] | 温瑞萍, 肖云, 王川龙. 基于均值修正的Toeplitz矩阵填充的增广拉格朗日乘子算法[J]. 数值计算与计算机应用, 2022, 43(1): 61-75. |
[2] | 王川龙, 张江梅. 基于F-模的Hankel矩阵填充的保结构阈值算法[J]. 数值计算与计算机应用, 2018, 39(1): 60-72. |
阅读次数 | ||||||
全文 |
|
|||||
摘要 |
|
|||||