Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations
From MaRDI portal
Publication:3458827
DOI10.1080/10556788.2015.1009977zbMath1336.90086arXiv1304.4964OpenAlexW3105254673WikidataQ114099390 ScholiaQ114099390MaRDI QIDQ3458827
Samantha E. Hansen, Todd Plantenga, Tamara G. Kolda
Publication date: 28 December 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.4964
Related Items (8)
Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer ⋮ Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications ⋮ WINTENDED: WINdowed TENsor decomposition for densification event detection in time-evolving networks ⋮ A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking ⋮ Rank decomposition and symmetric rank decomposition over arbitrary fields
Cites Work
- Tensor Decompositions and Applications
- Nonnegative tensor factorization as an alternative Csiszar-Tusnady procedure: algorithms, convergence, probabilistic interpretations and novel probabilistic tensor latent variable analysis algorithms
- Sparse non-negative tensor factorization using columnwise coordinate descent
- A comparison of algorithms for fitting the PARAFAC model
- Nonnegative matrix factorization with constrained second-order optimization
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Positive tensor factorization
- On the Complexity of Nonnegative Matrix Factorization
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Goldstein-Levitin-Polyak gradient projection method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
- On Tensors, Sparsity, and Nonnegative Factorizations
- Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
This page was built for publication: Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations
