A subspace-approximating algorithm for matrix completion

DOI10.1360/N012016-00025MaRDI QIDQ5063961zbMATH OpenOpenAlexFDO

Authors Chuanlong Wang, Xiaoli Li

Publication date 21 March 2022

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/n012016-00025

zbMATH Keywords

matrix completionquadratic programmingsubspace-approximating

Mathematics Subject Classification ID

Matrix completion problems (15A83) Quadratic programming (90C20)

Recommendations

• A subspace algorithm with mean value for Toeplitz matrix completion
• A new method based on the manifold-alternative approximating for low-rank matrix completion
• Low-rank approximation algorithms for matrix completion with random sampling
• Accelerated low rank matrix approximate algorithms for matrix completion
• Matrix completion via a low rank factorization model and an augmented Lagrangean succesive overrelaxation algorithm

Cited in

(5)

• A new method based on the manifold-alternative approximating for low-rank matrix completion
• A divide-and-conquer algorithm for binary matrix completion
• Sparse subspace clustering for data with missing entries and high-rank matrix completion
• Streaming principal component analysis from incomplete data
• Provable Subspace Tracking From Missing Data and Matrix Completion

This page was built for publication: A subspace-approximating algorithm for matrix completion

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