首页 | 本学科首页   官方微博 | 高级检索  
     

低秩矩阵恢复算法综述
引用本文:史加荣,郑秀云,魏宗田,杨 威.低秩矩阵恢复算法综述[J].计算机应用研究,2013,30(6):1601-1605.
作者姓名:史加荣  郑秀云  魏宗田  杨 威
作者单位:西安建筑科技大学 理学院,西安,710055
基金项目:国家自然科学基金资助项目(61179040); 陕西省教育厅专项科研计划资助项目(2013JK0587, 2013JK0588, 12JK1000)
摘    要:将鲁棒主成分分析、矩阵补全和低秩表示统称为低秩矩阵恢复,并对近年来出现的低秩矩阵恢复算法进行了简要的综述。讨论了鲁棒主成分分析的各种优化模型及相应的迭代算法,分析了矩阵补全问题及求解它的不精确增广拉格朗日乘子算法,介绍了低秩表示的优化模型及求解算法。最后指出了有待进一步研究的问题。

关 键 词:低秩矩阵恢复  鲁棒主成分分析  矩阵补全  低秩表示  增广拉格朗日乘子算法

Survey on algorithms of low-rank matrix recovery
SHI Jia-rong,ZHENG Xiu-yun,WEI Zong-tian,YANG Wei.Survey on algorithms of low-rank matrix recovery[J].Application Research of Computers,2013,30(6):1601-1605.
Authors:SHI Jia-rong  ZHENG Xiu-yun  WEI Zong-tian  YANG Wei
Affiliation:School of Science, Xi'an University of Architecture & Technology, Xi'an 710055, China
Abstract:This paper collectively referred robust principal component analysis, matrix completion and low-rank representation to as low-rank matrix recovery, and made a brief survey on the existing algorithms of low-rank matrix recovery. Firstly, it discussed various optimization models and the corresponding iterative algorithms for robust principal component analysis. Next, it analyzed the matrix completion problem and proposed the inexact augmented Lagrange multipliers algorithm to solve the problem. In addition, it introduced the optimization models for the low-rank representation problem and presented the iterative algorithm. Finally, this paper discussed several problems which need further research.
Keywords:low-rank matrix recovery  robust principal component analysis  matrix completion  low-rank representation  augmented Lagrange multipliers
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号