Positive matrix factorization via extremal polyhedral cones
From MaRDI portal
Let \(A,\) \(B,\) and \(C\) be positive \(k\times m,\) \(k\times n,\) and \(n\times m\) matrices, respectively, such that \(A=BC.\) The least integer \(n\) for which such a factorization of \(A\) exists is called the positive matrix rank of \(A.\) The authors reduce the search for the factorization of a positive matrix to the search for an embedding of a polyhedral cone in either an extremal polyhedral cone or in a facet of the positive orthant.
Recommendations
Cited in
(6)- Positive tensor factorization
- Quantum learning of classical stochastic processes: the completely positive realization problem
- Integer factorization of a positive-definite matrix
- On vector configurations that can be realized in the cone of positive matrices
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- A sufficient criterion for divisibility of quantum channels
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)