Incremental CP tensor decomposition by alternating minimization method
From MaRDI portal
Recommendations
- A Practical Randomized CP Tensor Decomposition
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Total variation based tensor decomposition for multi-dimensional data with time dimension.
- Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
Cites work
- A comparison of algorithms for fitting the PARAFAC model
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- A Multilinear Singular Value Decomposition
- A nonlinear GMRES optimization algorithm for canonical tensor decomposition
- A Practical Randomized CP Tensor Decomposition
- A Singular Value Decomposition Updating Algorithm for Subspace Tracking
- Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Coordinate descent algorithms
- Downdating the Singular Value Decomposition
- Exact matrix completion via convex optimization
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Fast low-rank modifications of the thin singular value decomposition
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 2085383 (Why is no real title available?)
- Incremental tensor subspace learning and its applications to foreground segmentation and tracking
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low-rank Tucker approximation of a tensor from streaming data
- Most tensor problems are NP-hard
- On Uniqueness of the nth Order Tensor Decomposition into Rank-1 Terms with Linear Independence in One Mode
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
- Tensor Decompositions and Applications
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor rank is NP-complete
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Updating the singular value decomposition
Cited in
(8)- A Practical Randomized CP Tensor Decomposition
- Incremental Calculation Framework for Complex Data
- Total variation based tensor decomposition for multi-dimensional data with time dimension.
- Incremental algorithms for truncated higher-order singular value decompositions
- An Incremental Tensor Train Decomposition Algorithm
- Tracking tensor ring decompositions of streaming tensors
- Dictionary-based block term decomposition for third-order tensors
- A quasi-subspace iteration method for canonical polyadic decomposition to third order tensors
This page was built for publication: Incremental CP tensor decomposition by alternating minimization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997836)
