Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836)

scientific article; zbMATH DE number 7365302

Language	Label	Description	Also known as
English	Incremental CP Tensor Decomposition by Alternating Minimization Method	scientific article; zbMATH DE number 7365302

Statements

instance of

scholarly article

0 references

title

Incremental CP Tensor Decomposition by Alternating Minimization Method (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

SIAM Journal on Matrix Analysis and Applications

0 references

publication date

30 June 2021

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

incremental tensor

0 references

CP decomposition

0 references

alternating minimization

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

A Practical Randomized CP Tensor Decomposition

0 references

Q3043872

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Fast low-rank modifications of the thin singular value decomposition

0 references

Updating the singular value decomposition

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Analysis of individual differences in multidimensional scaling via an $n$-way generalization of ``Eckart-Young'' decomposition

0 references

Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions

0 references

A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization

0 references

A Multilinear Singular Value Decomposition

0 references

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

0 references

Downdating the Singular Value Decomposition

0 references

Tensor rank is NP-complete

0 references

Most Tensor Problems Are NP-Hard

0 references

Incremental tensor subspace learning and its applications to foreground segmentation and tracking

0 references

Tensor Decompositions and Applications

0 references

Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

0 references

A Singular Value Decomposition Updating Algorithm for Subspace Tracking

0 references

Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data

0 references

Learning with tensors: a framework based on convex optimization and spectral regularization

0 references

Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization

0 references

On Uniqueness of the <i>n</i>th Order Tensor Decomposition into Rank-1 Terms with Linear Independence in One Mode

0 references

A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition

0 references

Low-Rank Tucker Approximation of a Tensor from Streaming Data

0 references

A comparison of algorithms for fitting the PARAFAC model

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

Exploiting Efficient Representations in Large-Scale Tensor Decompositions

0 references

Coordinate descent algorithms

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4997836