Accelerated matrix completion algorithm using continuation strategy and randomized SVD

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
Nearly unbiased variable selection under minimax concave penalty
An alternating direction method with continuation for nonconvex low rank minimization
Fixed point and Bregman iterative methods for matrix rank minimization
A randomized algorithm for the decomposition of matrices
Weighted nuclear norm minimization and its applications to low level vision
Online Schatten quasi-norm minimization for robust principal component analysis
Minimization of non-smooth, non-convex functionals by iterative thresholding
$S_{1/2}$ regularization methods and fixed point algorithms for affine rank minimization problems
Exact matrix completion via convex optimization
A Singular Value Thresholding Algorithm for Matrix Completion
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Ideal spatial adaptation by wavelet shrinkage
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
On $l_q$ Optimization and Matrix Completion
Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Robust quaternion matrix completion with applications to image inpainting
A Fast Optimization Transfer Algorithm for Image Inpainting in Wavelet Domains

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