Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion
From MaRDI portal
Publication:4573040
DOI10.1109/TSP.2011.2144977zbMath1392.94167arXiv1006.2195OpenAlexW2056405837MaRDI QIDQ4573040
No author found.
Publication date: 18 July 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.2195
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries ⋮ Fixed-rank matrix factorizations and Riemannian low-rank optimization ⋮ A Riemannian gossip approach to subspace learning on Grassmann manifold ⋮ Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
This page was built for publication: Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion
