Fast singular value thresholding without singular value decomposition

DOI10.4310/MAA.2013.V20.N4.A2zbMath1401.65042MaRDI QIDQ2511250

Stanley J. Osher, Jian-Feng Cai

Publication date: 5 August 2014

Published in: Methods and Applications of Analysis (Search for Journal in Brave)

zbMATH Keywords

Newton iterationsingular value thresholdinglow rank matrix

Mathematics Subject Classification ID

Related Items (10)

Low Permutation-rank Matrices: Structural Properties and Noisy Completion ⋮ Scalable Low-Rank Representation ⋮ Low-rank representation with adaptive graph regularization ⋮ Accelerated low rank matrix approximate algorithms for matrix completion ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion ⋮ A simple prior-free method for non-rigid structure-from-motion factorization ⋮ Modern regularization methods for inverse problems ⋮ Active Subspace: Toward Scalable Low-Rank Learning ⋮ A mean value algorithm for Toeplitz matrix completion

Uses Software

• SeDuMi
• SDPT3
• PROPACK
• LMaFit
• RTRMC
• mftoolbox

This page was built for publication: Fast singular value thresholding without singular value decomposition