Nonnegative ranks, decompositions, and factorizations of nonnegative matrices

DOI10.1016/0024-3795(93)90224-CzbMath0784.15001WikidataQ114215282 ScholiaQ114215282MaRDI QIDQ686375

Uriel G. Rothblum, Joel E. Cohen

Publication date: 13 October 1993

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

zbMATH Keywords

nonnegative matrixrational matrixstochastic matrixordered fieldbivariate probability matrixfinite algorithmnonnegative column ranknonnegative row rank

Mathematics Subject Classification ID

Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Vector spaces, linear dependence, rank, lineability (15A03) Stochastic matrices (15B51)

Related Items (83)

Extended formulations for convex heptagons ⋮ Rank functions of tropical matrices ⋮ Learning of Structurally Unambiguous Probabilistic Grammars ⋮ The rectangle covering number of random Boolean matrices ⋮ An upper bound on the dimension of minimal positive realizations for discrete time systems ⋮ Nonnegative Matrix Factorization Requires Irrationality ⋮ Heuristics for exact nonnegative matrix factorization ⋮ Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ Studying Non-negative Factorizations with Tools from Linear Algebra over a Semiring ⋮ Algebraic boundary of matrices of nonnegative rank at most three ⋮ A separation between tropical matrix ranks ⋮ Realization of positive linear systems ⋮ A note on the computation of the CP-rank ⋮ Minimal positive realizations: A survey ⋮ A polynomial-time algorithm for computing low CP-rank decompositions ⋮ Optimal thermal actuation for mirror temperature control ⋮ Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription ⋮ On the Set of Solutions of the Nonnegative Matrix Factorization Problem ⋮ Extension complexity of low-dimensional polytopes ⋮ The augmentation property of binary matrices for the binary and Boolean rank ⋮ DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling ⋮ Stability analysis of totally positive switched linear systems with average dwell time switching ⋮ Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes ⋮ Enhanced matrix power function for cryptographic primitive construction ⋮ The NMF problem and lattice-subspaces ⋮ The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions ⋮ Tropical positivity and determinantal varieties ⋮ Conic optimization-based algorithms for nonnegative matrix factorization ⋮ The role of rationality in integer-programming relaxations ⋮ Linear algebraic methods in communication complexity ⋮ Equivalence of state representations for hidden Markov models ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Symmetric nonnegative matrix trifactorization ⋮ On the nonnegative rank of distance matrices ⋮ Unnamed Item ⋮ Positive semidefinite rank and nested spectrahedra ⋮ The complexity of tropical matrix factorization ⋮ Computing symmetric nonnegative rank factorizations ⋮ Algorithms for approximate subtropical matrix factorization ⋮ Parameterized low-rank binary matrix approximation ⋮ Semi-nonnegative rank for real matrices and its connection to the usual rank ⋮ Nonnegative rank depends on the field ⋮ Euclidean distance matrices and separations in communication complexity theory ⋮ Nonnegative Tensor Train Factorizations and Some Applications ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ Variational approximation error in non-negative matrix factorization ⋮ Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory ⋮ On the similarity to nonnegative and Metzler Hessenberg forms ⋮ A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector ⋮ SVD based initialization: A head start for nonnegative matrix factorization ⋮ The real nonnegative inverse eigenvalue problem is NP-hard ⋮ Nonnegative rank factorization -- a heuristic approach via rank reduction ⋮ Simplex Factor Models for Multivariate Unordered Categorical Data ⋮ On the geometric interpretation of the nonnegative rank ⋮ On tropical matrices of small factor rank ⋮ An Almost Optimal Algorithm for Computing Nonnegative Rank ⋮ Probability matrices, non-negative rank, and parameterization of mixture models ⋮ On the nonnegative rank of Euclidean distance matrices ⋮ Extended formulations for polygons ⋮ Matrix Invariants over Semirings ⋮ Methods for nonnegative matrix factorization based on low-rank cross approximations ⋮ Rational and real positive semidefinite rank can be different ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Factoring a band matrix over a semiring ⋮ Tropical geometry of statistical models ⋮ Trace Refinement in Labelled Markov Decision Processes ⋮ Lower bounds on nonnegative rank via nonnegative nuclear norms ⋮ Tropical lower bounds for extended formulations ⋮ Extended formulations, nonnegative factorizations, and randomized communication protocols ⋮ Positive semidefinite rank ⋮ Worst-case results for positive semidefinite rank ⋮ Computing a Nonnegative Matrix Factorization---Provably ⋮ A lower bound on the dimension of minimal positive realizations for discrete time systems ⋮ Nonnegative tensor train factorization with DMRG technique ⋮ Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains ⋮ Extension Complexity of Polytopes with Few Vertices or Facets ⋮ Real rank versus nonnegative rank ⋮ Semidefinite Programming and Nash Equilibria in Bimatrix Games ⋮ Fixed points of the EM algorithm and nonnegative rank boundaries ⋮ An upper bound for nonnegative rank ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Fooling-sets and rank ⋮ Communication tasks in operational theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inertia characteristics of self-adjoint matrix polynomials
• Combinatorial results on completely positive matrices
• When are probabilistic explanations possible?
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• A new decision method for elementary algebra
• A Theory on Extending Algorithms for Parametric Problems
• The ∏ Method for Estimating Multivariate Functions from Noisy Data
• Decision procedures for real and p‐adic fields

This page was built for publication: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices