Positive matrix factorization via extremal polyhedral cones

DOI10.1016/S0024-3795(99)00038-5MaRDI QIDQ1963935zbMATH OpenFDO

Authors Jacqueline M. van den Hof, Jan H. van Schuppen

Publication date 31 July 2000

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

Full work available at URL https://doi.org/10.1016/S0024-3795(99)00038-5

zbMATH Keywords

extremal polyhedral conepositive matrix factorizationpositive matrix rankpositive rank

Mathematics Subject Classification ID

Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48)

Recommendations

• The nonnegative rank factorizations of nonnegative matrices
• The complexity of positive semidefinite matrix factorization
• The NMF problem and lattice-subspaces
• Integer factorization of a positive-definite matrix
• A factorization method for completely positive matrices

Cited in

(6)

• A sufficient criterion for divisibility of quantum channels
• Positive tensor factorization
• Quantum learning of classical stochastic processes: the completely positive realization problem
• Integer factorization of a positive-definite matrix
• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
• On vector configurations that can be realized in the cone of positive matrices

This page was built for publication: Positive matrix factorization via extremal polyhedral cones

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