A universal rank approximation method for matrix completion

DOI10.1142/S0219691322500163MaRDI QIDQ5097888zbMATH OpenOpenAlexWikidataFDO

Authors Jinyao Yan, Xin-hong Meng, Feilong Cao, Hailiang Ye

Publication date 1 September 2022

Published in International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219691322500163

zbMATH Keywords

image restorationlow-rankmatrix completionrank approximation

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computing methodologies for image processing (68U10) Approximation algorithms (68W25)

Recommendations

• Smooth singular value thresholding algorithm for low-rank matrix completion problem
• Low-rank matrix completion by Riemannian optimization
• Robust low-rank matrix completion by Riemannian optimization
• Some empirical advances in matrix completion
• Matrix factorization for low-rank tensor completion using framelet prior

Cites work

• A Deterministic Theory of Low Rank Matrix Completion
• A Hybrid Truncated Norm Regularization Method for Matrix Completion
• A Riemannian rank-adaptive method for low-rank matrix completion
• A Singular Value Thresholding Algorithm for Matrix Completion
• A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
• A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Exact matrix completion via convex optimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• scientific article; zbMATH DE number 823379 (Why is no real title available?)
• scientific article; zbMATH DE number 7306912 (Why is no real title available?)
• scientific article; zbMATH DE number 6276219 (Why is no real title available?)
• Light Field Inpainting Propagation via Low Rank Matrix Completion
• Matrix Completion and Extrapolation via Kernel Regression
• New and efficient DCA based algorithms for minimum sum-of-squares clustering
• Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
• Nonlinear Low-Rank Matrix Completion for Human Motion Recovery
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Weighted nuclear norm minimization and its applications to low level vision

Cited in

(4)

• Unitary dilation approach to contractive matrix completion.
• Typical and generic ranks in matrix completion
• scientific article; zbMATH DE number 7306912 (Why is no real title available?)
• On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty

This page was built for publication: A universal rank approximation method for matrix completion

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