Incremental CP Tensor Decomposition by Alternating Minimization Method
From MaRDI portal
Publication:4997836
DOI10.1137/20M1319097zbMath1470.90086MaRDI QIDQ4997836
Publication date: 30 June 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Incremental tensor subspace learning and its applications to foreground segmentation and tracking
- A comparison of algorithms for fitting the PARAFAC model
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Coordinate descent algorithms
- Fast low-rank modifications of the thin singular value decomposition
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
- On Uniqueness of the nth Order Tensor Decomposition into Rank-1 Terms with Linear Independence in One Mode
- Tensor rank is NP-complete
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Singular Value Decomposition Updating Algorithm for Subspace Tracking
- A Multilinear Singular Value Decomposition
- Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- A Practical Randomized CP Tensor Decomposition
- Downdating the Singular Value Decomposition
- Low-Rank Tucker Approximation of a Tensor from Streaming Data
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Most Tensor Problems Are NP-Hard
- Updating the singular value decomposition
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Incremental CP Tensor Decomposition by Alternating Minimization Method