A Geometric Approach to Low-Rank Matrix Completion

DOI10.1109/TIT.2011.2171521zbMath1365.15037arXiv1006.2086OpenAlexW1855068118MaRDI QIDQ5272162

No author found.

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.2086

Mathematics Subject Classification ID

Synthetic treatment of fundamental manifolds in projective geometries (Grassmannians, Veronesians and their generalizations) (51M35) Matrix completion problems (15A83)

Related Items (8)

Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit ⋮ A Broyden Class of Quasi-Newton Methods for Riemannian Optimization ⋮ Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques ⋮ Intrinsic representation of tangent vectors and vector transports on matrix manifolds ⋮ 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: A Geometric Approach to Low-Rank Matrix Completion