A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
From MaRDI portal
Publication:2217856
DOI10.1155/2020/8812701zbMath1459.90151OpenAlexW3117158410MaRDI QIDQ2217856
Yun Xiao, Yonghong Duan, Rui-Ping 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A new gradient projection method for matrix completion
- Minimax risk of matrix denoising by singular value thresholding
- A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
- Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
- Matrix completion by singular value thresholding: sharp bounds
- 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
- Matrix estimation by universal singular value thresholding
- Exact matrix completion via convex optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Matrix completion via an alternating direction method
- The complexity of matrix completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
- Spectral Compressed Sensing via Projected Gradient Descent
This page was built for publication: A singular value thresholding with diagonal-update algorithm for low-rank matrix completion