An efficient method for non-negative low-rank completion
type: Item
instance of: scholarly article
title: An efficient method for non-negative low-rank completion
zbMATH Open document ID: 1436.65050
author: Nicola Guglielmi
author: Carmela Scalone
published in: Advances in Computational Mathematics
publication date: 2020-04-08T00:00:00Z
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65F55
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 15A23
zbMATH DE Number: 7188451
zbMATH Keywords: low-rank completion
zbMATH Keywords: non-negative completion
zbMATH Keywords: non-negative factorization
zbMATH Keywords: Netflix problem
MaRDI profile type: Publication
full work available at URL: s10444-020-09779-x
OpenAlex ID: W3013722859
cites work: Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation
cites work: Q4326384
cites work: Q4448872
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Robust low-rank matrix completion by Riemannian optimization
cites work: Q3567881
cites work: Exact matrix completion via convex optimization
cites work: Sensor network localization, Euclidean distance matrix completions, and graph realization
cites work: Q4226179
cites work: Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
cites work: On the geometric interpretation of the nonnegative rank
cites work: Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
cites work: Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra
cites work: Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
cites work: On the Nearest Singular Matrix Pencil
cites work: Dynamical Low‐Rank Approximation
cites work: Structured low-rank approximation with missing data
cites work: A gradient system for low rank matrix completion
cites work: An alternating direction algorithm for matrix completion with nonnegative factors
cites work: Low-rank matrix completion by Riemannian optimization
DOI: 10.1007/S10444-020-09779-X
description: scientific article; zbMATH DE number 7188451