A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
From MaRDI portal
Publication:1631439
DOI10.1016/j.cam.2018.05.046zbMath1404.65031OpenAlexW2806735006MaRDI QIDQ1631439
Min Xi, Yannan Chen, Wen-Yu Sun, Jin Yun Yuan
Publication date: 6 December 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.05.046
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Multilinear algebra, tensor calculus (15A69)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Eigenvalues and invariants of tensors
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalization
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- Musings on multilinear fitting
- Numerical multilinear algebra and its applications
- Optimization theory and methods. Nonlinear programming
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Square regularization matrices for large linear discrete ill-posed problems
- Positive Semidefinite Generalized Diffusion Tensor Imaging via Quadratic Semidefinite Programming
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Algorithm 862
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A Block Component Model-Based Blind DS-CDMA Receiver
- New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions
- Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Fast nonstationary preconditioned iterative methods for ill-posed problems, with application to image deblurring
