Accelerated matrix completion algorithm using continuation strategy and randomized SVD

DOI10.1016/J.CAM.2023.115215MaRDI QIDQ6136545zbMATH OpenFDO

Authors You-Wei Wen, Kexin Li, Hefeng Chen

Publication date 31 August 2023

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2023.115215

zbMATH Keywords

matrix completionalternating minimizationrandomized singular value decompositioncontinuation strategynon-convex surrogate

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A matrix completion algorithm using randomized SVD
• Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm
• A Singular Value Thresholding Algorithm for Matrix Completion
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Matrix completion via minimizing an approximate rank

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A Fast Optimization Transfer Algorithm for Image Inpainting in Wavelet Domains
• A Singular Value Thresholding Algorithm for Matrix Completion
• A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
• A randomized algorithm for the decomposition of matrices
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• An alternating direction method with continuation for nonconvex low rank minimization
• Analysis of multi-stage convex relaxation for sparse regularization
• Exact matrix completion via convex optimization
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Fixed point and Bregman iterative methods for matrix rank minimization
• Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Ideal spatial adaptation by wavelet shrinkage
• Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
• Minimization of non-smooth, non-convex functionals by iterative thresholding
• Nearly unbiased variable selection under minimax concave penalty
• Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
• On $l_q$ Optimization and Matrix Completion
• Online Schatten quasi-norm minimization for robust principal component analysis
• Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
• Robust quaternion matrix completion with applications to image inpainting.
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Weighted nuclear norm minimization and its applications to low level vision
• \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems

Cited in

(2)

• A parameterized three-operator splitting algorithm for non-convex minimization problems with applications
• Randomized methods for dynamical low-rank approximation

This page was built for publication: Accelerated matrix completion algorithm using continuation strategy and randomized SVD

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