A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm

DOI10.1016/J.ACHA.2011.04.004zbMath1401.90165OpenAlexW2077855744MaRDI QIDQ643650

Wei Zhu, Li-Zhi Cheng, Hui Zhang

Publication date: 2 November 2011

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2011.04.004

zbMATH Keywords

convex optimizationnuclear normexact matrix completionSVT algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Convex programming (90C25) Matrix completion problems (15A83)

Related Items (4)

Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization ⋮ A singular value thresholding with diagonal-update algorithm for low-rank matrix completion ⋮ First-order optimality condition of basis pursuit denoise problem ⋮ New regularization method and iteratively reweighted algorithm for sparse vector recovery

Cites Work

• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• Exact matrix completion via convex optimization
• Analysis and Generalizations of the Linearized Bregman Method
• Linearized Bregman iterations for compressed sensing
• A Singular Value Thresholding Algorithm for Matrix Completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm