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

DOI10.1016/J.ACHA.2011.04.004MaRDI QIDQ643650zbMATH OpenOpenAlexFDO

Authors Li-zhi Cheng, Wei Zhu, 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

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

Recommendations

• Matrix completion by singular value thresholding: sharp bounds
• A Singular Value Thresholding Algorithm for Matrix Completion
• Analysis of singular value thresholding algorithm for matrix completion
• A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
• Bounds for eigenvalues and singular values of matrix completions
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
• A Deterministic Theory of Low Rank Matrix Completion
• Exact matrix completion via convex optimization
• Half thresholding eigenvalue algorithm for semidefinite matrix completion
• Matrix completion via minimizing an approximate rank

Cites work

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

Cited in

(10)

• A parameterized three-operator splitting algorithm for non-convex minimization problems with applications
• A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
• Analysis of singular value thresholding algorithm for matrix completion
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
• A Singular Value Thresholding Algorithm for Matrix Completion
• Bounds for eigenvalues and singular values of matrix completions
• New regularization method and iteratively reweighted algorithm for sparse vector recovery
• First-order optimality condition of basis pursuit denoise problem
• Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
• Matrix completion by singular value thresholding: sharp bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643650)