Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods
From MaRDI portal
Publication:6191800
DOI10.4208/aam.oa-2023-0010OpenAlexW4380792218MaRDI QIDQ6191800
Michael Kwok-Po Ng, Guang-Jing Song
Publication date: 11 March 2024
Published in: Annals of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/aam.oa-2023-0010
Cites Work
- Unnamed Item
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- An alternating direction algorithm for matrix completion with nonnegative factors
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- Fast Cadzow's algorithm and a gradient variant
- Guarantees of Riemannian optimization for low rank matrix completion
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- Low-Rank Matrix Completion by Riemannian Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Introducing a weighted non-negative matrix factorization for image classification
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Matrix Preconditioning Techniques and Applications
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Learning the parts of objects by non-negative matrix factorization
- A Simpler Approach to Matrix Completion
This page was built for publication: Nonnegative Low Rank Matrix Completion by Riemannian Optimalization Methods
