New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions

DOI10.1109/TSP.2011.2164911MaRDI QIDQ4573363zbMATHOpenAlexFDO

Authors Yannan Chen, Deren Han, Liqun Qi

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2011.2164911

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Vector and tensor algebra, theory of invariants (15A72)

Recommendations

• scientific article; zbMATH DE number 7506688
• A trust-region-based alternating least-squares algorithm for tensor decompositions
• An ATLD-ALS method for the trilinear decomposition of large third-order tensors
• A self-adaptive regularized alternating least squares method for tensor decomposition problems
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• Accelerating alternating least squares for tensor decomposition by pairwise perturbation
• Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors

Cited in

(10)

• On global convergence of alternating least squares for tensor approximation
• A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
• Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors
• A Riemannian trust region method for the canonical tensor rank approximation problem
• Convenient tail bounds for sums of random tensors
• A literature survey of low-rank tensor approximation techniques
• Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
• A promising technique for blind identification: the generic statistics
• Exact line and plane search for tensor optimization

This page was built for publication: New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573363)