Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
type: Item
instance of: scholarly article
title: Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
zbMATH Open document ID: 1391.65109
author: Tomohiko Mizutani
published in: Linear Algebra and its Applications
publication date: 2016-03-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1506.08387
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A12
Mathematics Subject Classification ID: 15A23
Mathematics Subject Classification ID: 65F08
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6552073
zbMATH Keywords: nonnegative matrix factorization
zbMATH Keywords: separability
zbMATH Keywords: successive projection algorithm
zbMATH Keywords: robustness to noise
zbMATH Keywords: preconditioning
MaRDI profile type: Publication
OpenAlex ID: W2137605774
arXiv ID: 1506.08387
cites work: Computing a nonnegative matrix factorization -- provably
cites work: Handbook series linear algebra. Linear least squares solutions by Householder transformations
cites work: Enhancing Pure-Pixel Identification Performance via Preconditioning
cites work: Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
cites work: Q5689624
cites work: Rounding of Polytopes in the Real Number Model of Computation
cites work: Q2934020
cites work: Computation of Minimum-Volume Covering Ellipsoids
cites work: On the Complexity of Nonnegative Matrix Factorization
DOI: 10.1016/J.LAA.2016.02.016
description: scientific article