Two modified algorithms for matrix completion using hard-thresholding algorithm

DOI10.12288/SZJS.S2019-0611MaRDI QIDQ5017361zbMATH OpenFDO

Authors Junxia Wang, Qian-Ying Shen, Chuanlong Wang

Publication date 17 December 2021

Full work available at URL https://doi.org/10.12288/SZJS.S2019-0611

zbMATH Keywords

matrix completionhard-thresholdingdiagonally modificationminimizing the rank

Mathematics Subject Classification ID

Matrix completion problems (15A83) Conditioning of matrices (15A12)

Recommendations

• A modified orthogonal rank-one matrix pursuit for Toeplitz matrix completion
• A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
• Normalized iterative hard thresholding for matrix completion
• Accelerated low rank matrix approximate algorithms for matrix completion
• The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion

Cited in

(3)

• Enhancing matrix completion using a modified second-order total variation
• A modified primal-dual algorithm for matrix completion problems
• Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion

This page was built for publication: Two modified algorithms for matrix completion using hard-thresholding algorithm

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