A subspace-approximating algorithm for matrix completion

DOI10.1360/N012016-00025zbMATH Open1499.15094OpenAlexW2801678411MaRDI QIDQ5063961

Xiaoli Li, Chuanlong Wang

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

quadratic programmingmatrix completionsubspace-approximating

Mathematics Subject Classification ID

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

Related Items (2)

A divide-and-conquer algorithm for binary matrix completion ⋮ 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)