Smooth singular value thresholding algorithm for low-rank matrix completion problem

DOI10.4134/JKMS.J230181zbMATH Open1545.6519MaRDI QIDQ6545075FDOQ6545075

Authors: Geunseop Lee 

Publication date: 29 May 2024

Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

matrix completionsingular value thresholdingStein unbiased risk estimator

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• Estimation of the mean of a multivariate normal distribution
• A Singular Value Thresholding Algorithm for Matrix Completion
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Stable signal recovery from incomplete and inaccurate measurements
• Discrete inverse problems. Insight and algorithms.
• Adaptive shrinkage of singular values
• Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
• Optimal Shrinkage of Singular Values
• Regularised PCA to denoise and visualise data
• Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
• Title not available (Why is that?)
• Affine matrix rank minimization problem via non-convex fraction function penalty
• Matrix and Tensor Factorization Techniques for Recommender Systems

This page was built for publication: Smooth singular value thresholding algorithm for low-rank matrix completion problem

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