Further restricted versions of the nonnegative matrix factorization problem

DOI10.1016/J.LAA.2025.01.040MaRDI QIDQ7018414zbMATH OpenFDO

Authors Ya. N. Shitov

Publication date 5 March 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.01.040

zbMATH Keywords

matricesnonnegative rank

Mathematics Subject Classification ID

Factorization of matrices (15A23) Vector spaces, linear dependence, rank, lineability (15A03)

Cites work

• scientific article; zbMATH DE number 4092241 (Why is no real title available?)
• An upper bound for nonnegative rank
• Completely positive matrices associated withM-matrices
• Expressing combinatorial optimization problems by linear programs
• Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On the geometric interpretation of the nonnegative rank
• On the nonnegative rank of distance matrices
• Real rank versus nonnegative rank
• Realization spaces of 4-polytopes are universal
• Symmetric nonnegative matrix trifactorization
• The Art Gallery Problem is ∃ℝ-complete
• The complexity of positive semidefinite matrix factorization

This page was built for publication: Further restricted versions of the nonnegative matrix factorization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7018414)