A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
DOI10.1007/s10492-013-0026-2zbMath1299.65065OpenAlexW2072719601MaRDI QIDQ2444509
Lixing Han, Douglas Bunker, Shuhua Zhang
Publication date: 9 April 2014
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/143429
global convergencenumerical resultsproximal methodnonnegative tensor factorizationalternating least squares methodsenhanced line search
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Multilinear algebra, tensor calculus (15A69)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Computing the polyadic decomposition of nonnegative third order tensors
- A comparison of algorithms for fitting the PARAFAC model
- Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
- An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Algorithms for Sparse Nonnegative Tucker Decompositions
- Monotone Operators and the Proximal Point Algorithm
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Learning the parts of objects by non-negative matrix factorization
- Computing non-negative tensor factorizations
This page was built for publication: A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
