Numerical method for the generalized nonnegative tensor factorization problem

DOI10.1007/s11075-020-00975-wzbMath1465.65037OpenAlexW3041006936MaRDI QIDQ2028020

Yanyan Li

Publication date: 31 May 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-00975-w

zbMATH Keywords

local solutionconvergence theoremgeneralized nonnegative tensor factorizationproximal alternating nonnegative least squares method

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Cites Work

• Unnamed Item
• Efficient nonnegative matrix factorization via projected Newton method
• Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
• Nonnegative tensor factorizations using an alternating direction method
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Document clustering using nonnegative matrix factorization
• Positive tensor factorization
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization

This page was built for publication: Numerical method for the generalized nonnegative tensor factorization problem