A singular value thresholding with diagonal-update algorithm for low-rank matrix completion

DOI10.1155/2020/8812701zbMATH Open1459.90151OpenAlexW3117158410MaRDI QIDQ2217856FDOQ2217856

Authors: Yonghong Duan, Yun Xiao, Ruiping Wen 

Publication date: 14 January 2021

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8812701

Recommendations

• A Singular Value Thresholding Algorithm for Matrix Completion
• A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
• Matrix completion by singular value thresholding: sharp bounds
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
• Analysis of singular value thresholding algorithm for matrix completion
• Transformed Schatten-1 iterative thresholding algorithms for low rank matrix completion
• Low rank update of singular values
• Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
• Fast low-rank modifications of the thin singular value decomposition
• Matrix completion and low-rank SVD via fast alternating least squares

Mathematics Subject Classification ID

Convex programming (90C25) Matrix completion problems (15A83)

Cites Work

• Matrix estimation by universal singular value thresholding
• A Singular Value Thresholding Algorithm for Matrix Completion
• Exact matrix completion via convex optimization
• Matrix completion by singular value thresholding: sharp bounds
• Matrix completion via an alternating direction method
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Title not available (Why is that?)
• Interior-point method for nuclear norm approximation with application to system identification
• A new gradient projection method for matrix completion
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
• Minimax risk of matrix denoising by singular value thresholding
• The complexity of matrix completion
• A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
• Spectral Compressed Sensing via Projected Gradient Descent
• Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
• Low rank matrix completion by alternating steepest descent methods
• The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
• Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion

Cited In (8)

• Analysis of singular value thresholding algorithm for matrix completion
• A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
• Fast singular value thresholding without singular value decomposition
• A Singular Value Thresholding Algorithm for Matrix Completion
• A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
• Smooth singular value thresholding algorithm for low-rank matrix completion problem
• Matrix completion by singular value thresholding: sharp bounds
• A universal rank approximation method for matrix completion

This page was built for publication: A singular value thresholding with diagonal-update algorithm for low-rank matrix completion

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