Nonnegative ranks, decompositions, and factorizations of nonnegative matrices

DOI10.1016/0024-3795(93)90224-CzbMATH Open0784.15001WikidataQ114215282 ScholiaQ114215282MaRDI QIDQ686375FDOQ686375

Authors: Joel E. Cohen, Uriel G. Rothblum 

Publication date: 13 October 1993

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

Recommendations

• The nonnegative rank factorizations of nonnegative matrices
• Real rank versus nonnegative rank
• Column ranks and their preservers over nonnegative real matrices.
• Nonnegative rank depends on the field
• Studying non-negative factorizations with tools from linear algebra over a semiring

zbMATH Keywords

stochastic matrixnonnegative matrixrational 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) Stochastic matrices (15B51) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

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

Cited In (93)

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

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

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