Quasi-orthogonalization for alternating non-negative tensor factorization
From MaRDI portal
Publication:6572627
DOI10.1553/etna_vol62s22zbMath1543.65048MaRDI QIDQ6572627
Maren Klever, Lars Grasedyck, Sebastian Krämer
Publication date: 16 July 2024
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
orthogonalization\(M\)-matriceshigh-dimensional problemsalternating least-squaresnon-negative factorizationlow-rank tensors
Factorization of matrices (15A23) Numerical mathematical programming methods (65K05) Linear programming (90C05) Vector and tensor algebra, theory of invariants (15A72) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- The geometry of algorithms using hierarchical tensors
- The Kronecker product and stochastic automata networks
- Product-form stationary distributions for deficiency zero chemical reaction networks
- A new polynomial-time algorithm for linear programming
- Iterative methods for overflow queueing models. I
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- On the complexity of approximating a KKT point of quadratic programming
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Nonnegative low rank matrix approximation for nonnegative matrices
- Low-rank tensor methods for Markov chains with applications to tumor progression models
- A new scheme for the tensor representation
- On manifolds of tensors of fixed TT-rank
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- A literature survey of low-rank tensor approximation techniques
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
- Hierarchical Singular Value Decomposition of Tensors
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Matrix Methods for Queuing Problems
- Lectures on Polytopes
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- Duality of graphical models and tensor networks
- Accelerating block coordinate descent for nonnegative tensor factorization
- Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms
- Learning the parts of objects by non-negative matrix factorization
- Stochastic fluctuations in metabolic pathways
- Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
- A Recurring Theorem on Determinants
- Study of performance of low-rank nonnegative tensor factorization methods
- Least-squares methods for nonnegative matrix factorization over rational functions
This page was built for publication: Quasi-orthogonalization for alternating non-negative tensor factorization