Pages that link to "Item:Q3586139"

The following pages link to On the Complexity of Nonnegative Matrix Factorization (Q3586139):

Displaying 50 items.

• Analyzing Raman spectral data without separabiliy assumption (Q115286) (← links)
• Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem (Q254874) (← links)
• Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
• Algebraic boundary of matrices of nonnegative rank at most three (Q307808) (← links)
• A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
• Global convergence of modified multiplicative updates for nonnegative matrix factorization (Q461447) (← links)
• Subtractive clustering for seeding non-negative matrix factorizations (Q498042) (← links)
• The real nonnegative inverse eigenvalue problem is NP-hard (Q518113) (← links)
• Computing symmetric nonnegative rank factorizations (Q651217) (← links)
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
• Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
• Positive semidefinite rank (Q745689) (← links)
• Worst-case results for positive semidefinite rank (Q745690) (← links)
• Convex nonnegative matrix factorization with manifold regularization (Q889387) (← links)
• Using underapproximations for sparse nonnegative matrix factorization (Q962750) (← links)
• A very brief introduction to nonnegative tensors from the geometric viewpoint (Q1634685) (← links)
• Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
• Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription (Q1661478) (← links)
• Matrix product constraints by projection methods (Q1675556) (← links)
• Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
• Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution (Q1735306) (← links)
• On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
• A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization (Q1790683) (← links)
• Optimal Bayesian clustering using non-negative matrix factorization (Q1796973) (← links)
• Nonnegative tensor factorizations using an alternating direction method (Q1945572) (← links)
• A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
• Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery (Q2011581) (← links)
• Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
• Factoring a band matrix over a semiring (Q2041261) (← links)
• A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence (Q2089877) (← links)
• Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
• Learning without loss (Q2138443) (← links)
• Bounding the separable rank via polynomial optimization (Q2144234) (← links)
• Minimal positive realizations: A survey (Q2158979) (← links)
• On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
• Algorithms for approximate subtropical matrix factorization (Q2218339) (← links)
• Nonnegative rank depends on the field (Q2227545) (← links)
• Sparse convex hull coverage (Q2230408) (← links)
• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices (Q2238337) (← links)
• Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962) (← links)
• Methods for nonnegative matrix factorization based on low-rank cross approximations (Q2278210) (← links)
• Nonnegative tensor train factorization with DMRG technique (Q2304589) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• Fixed points of the EM algorithm and nonnegative rank boundaries (Q2338932) (← links)
• An upper bound for nonnegative rank (Q2341256) (← links)
• An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization (Q2344463) (← links)
• Enhanced matrix power function for cryptographic primitive construction (Q2415047) (← links)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
• A multilevel approach for nonnegative matrix factorization (Q2428091) (← links)