A trust-region-based alternating least-squares algorithm for tensor decompositions
DOI10.4208/JCM.1605-M2016-0828zbMATH Open1413.90178OpenAlexW2800284767WikidataQ129877889 ScholiaQ129877889MaRDI QIDQ4688178FDOQ4688178
Authors: Fan Jiang, Deren Han, Xiao-Fei Zhang 
Publication date: 22 October 2018
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/jcm.1605-m2016-0828
Recommendations
- A self-adaptive regularized alternating least squares method for tensor decomposition problems
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- Local convergence of the alternating least squares algorithm for canonical tensor approximation
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- A Practical Randomized CP Tensor Decomposition
regularizationtensor decompositionsglobal convergencetrust region methodextrapolation schemealternating least-squares
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)
Cited In (6)
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- On accelerating the regularized alternating least-squares algorithm for tensors
- Line search and trust region strategies for canonical decomposition of semi-nonnegative semi-symmetric 3rd order tensors
- A self-adaptive regularized alternating least squares method for tensor decomposition problems
This page was built for publication: A trust-region-based alternating least-squares algorithm for tensor decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4688178)
