An efficient method for non-negative low-rank completion
From MaRDI portal
Publication:1986538
DOI10.1007/s10444-020-09779-xzbMath1436.65050OpenAlexW3013722859MaRDI QIDQ1986538
Nicola Guglielmi, Carmela Scalone
Publication date: 8 April 2020
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-020-09779-x
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (2)
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds ⋮ Positivity preserving stochastic \(\theta\)-methods for selected SDEs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
- An alternating direction algorithm for matrix completion with nonnegative factors
- On the geometric interpretation of the nonnegative rank
- A gradient system for low rank matrix completion
- Exact matrix completion via convex optimization
- Robust Low-Rank Matrix Completion by Riemannian Optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Structured Low-Rank Approximation with Missing Data
- A Singular Value Thresholding Algorithm for Matrix Completion
- Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
- Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation
- Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra
- On the Nearest Singular Matrix Pencil
- Dynamical Low‐Rank Approximation
This page was built for publication: An efficient method for non-negative low-rank completion
