Nonnegative tensor decomposition via collaborative neurodynamic optimization
From MaRDI portal
Cites work
- A collective neurodynamic optimization approach to bound-constrained nonconvex optimization
- A discrete-time neurodynamic approach to sparsity-constrained nonnegative matrix factorization
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
- A one-layer recurrent neural network for constrained nonconvex optimization
- An Introduction to Variational Inequalities and Their Applications
- Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines
- Computing the polyadic decomposition of nonnegative third order tensors
- Cubic regularization of Newton method and its global performance
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- scientific article; zbMATH DE number 3568468 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Low complexity damped Gauss-Newton algorithms for CANDECOMP/PARAFAC
- Minimization by Random Search Techniques
- Multiple invariants and generalized rank of a p-way matrix or tensor.
- Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization
- Nonlinear Hyperspectral Unmixing With Robust Nonnegative Matrix Factorization
- Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers
- On the stability of globally projected dynamical systems
- Recurrent Neural Networks for Computing Pseudoinverses of Rank-Deficient Matrices
- Recurrent neural networks for LU decomposition and Cholesky factorization
- Recurrent neural networks for solving linear matrix equations
- Robust Blind Source Separation by Beta Divergence
- Smooth PARAFAC Decomposition for Tensor Completion
- Sparse signal reconstruction via collaborative neurodynamic optimization
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor-train decomposition
- The expression of a tensor or a polyadic as a sum of products.
- Visualizing data using t-SNE
This page was built for publication: Nonnegative tensor decomposition via collaborative neurodynamic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7032361)
