Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization

DOI10.1137/140993272zbMath1327.15027arXiv1410.7220OpenAlexW2129354191MaRDI QIDQ3195441

Nicolas Gillis, Abhishek Kumar

Publication date: 19 October 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsinitializationsemi-nonnegative ranklow-rank matrix approximationsemi-nonnegative matrix factorization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Factorization of matrices (15A23)

Related Items (3)

Nonnegative Matrix Factorization Via Archetypal Analysis ⋮ Blind Source Separation with Outliers in Transformed Domains ⋮ Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-nonnegative rank for real matrices and its connection to the usual rank
• Sparse non-negative tensor factorization using columnwise coordinate descent
• A continuous characterization of the maximum-edge biclique problem
• On the geometric interpretation of the nonnegative rank
• Graph Implementations for Nonsmooth Convex Programs
• On the Complexity of Nonnegative Matrix Factorization
• Some NP-complete problems in quadratic and nonlinear programming
• Computational Complexity
• Learning the parts of objects by non-negative matrix factorization
• Systems of distinct representatives and linear algebra

This page was built for publication: Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization