On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation
Author:
Affiliation:
1. Department of Mathematics and Operational Research, University of Mons, 7000 Mons, Belgium
2. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference31 articles.
1. Approximating the Cut-Norm via Grothendieck's Inequality
2. Nuclear norm minimization for the planted clique and biclique problems
3. Complexity of finding dense subgraphs
4. The L1-norm best-fit hyperplane problem
5. A pure L1-norm principal component analysis
Cited by 23 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Binary matrix factorization via collaborative neurodynamic optimization;Neural Networks;2024-08
2. Rank-One Boolean Tensor Factorization and the Multilinear Polytope;Mathematics of Operations Research;2024-07-09
3. Robust Parallel Pursuit for Large-Scale Association Network Learning;INFORMS Journal on Computing;2024-05-16
4. Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size;SIAM Journal on Optimization;2024-01-04
5. The art of centering without centering for robust principal component analysis;Data Mining and Knowledge Discovery;2023-10-09
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3