New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
From MaRDI portal
Publication:4573363
DOI10.1109/TSP.2011.2164911zbMath1393.94194OpenAlexW2061169295MaRDI QIDQ4573363
Liqun Qi, Yannan Chen, Deren Han
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
Vector and tensor algebra, theory of invariants (15A72) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
A seminorm regularized alternating least squares algorithm for canonical tensor decomposition ⋮ A promising technique for blind identification: the generic statistics ⋮ Convenient tail bounds for sums of random tensors ⋮ Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization ⋮ On global convergence of alternating least squares for tensor approximation ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Exact line and plane search for tensor optimization ⋮ Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems