An alternating direction method with increasing penalty for stable principal component pursuit
From MaRDI portal
Publication:493688
DOI10.1007/s10589-015-9736-6zbMath1326.90061arXiv1309.6553MaRDI QIDQ493688
Publication date: 4 September 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6553
convex optimization; matrix completion; principal component analysis; alternating direction method of multipliers; compressed sensing; variable penalty
90C25: Convex programming
Uses Software