The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
From MaRDI portal
(Redirected from Publication:5146632)
Abstract: The epsilon alternating least squares (-ALS) is developed and analyzed for canonical polyadic decomposition (approximation) of a higher-order tensor where one or more of the factor matrices are assumed to be columnwisely orthonormal. It is shown that the algorithm globally converges to a KKT point for all tensors without any assumption. For the original ALS, by further studying the properties of the polar decomposition, we also establish its global convergence under a reality assumption not stronger than those in the literature. These results completely address a question concerning the global convergence raised in [L. Wang, M. T. Chu and B. Yu, emph{SIAM J. Matrix Anal. Appl.}, 36 (2015), pp. 1--19]. In addition, an initialization procedure is proposed, which possesses a provable lower bound when the number of columnwisely orthonormal factors is one. Armed with this initialization procedure, numerical experiments show that the -ALS exhibits a promising performance in terms of efficiency and effectiveness.
Recommendations
- On global convergence of alternating least squares for tensor approximation
- Local convergence of the alternating least squares algorithm for canonical tensor approximation
- Orthogonal low rank tensor approximation: alternating least squares method and its global convergence
- On the global convergence of the alternating least squares method for rank-one approximation to generic tensors
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
Cites work
- A Multilinear Singular Value Decomposition
- A new convergence proof for the higher-order power method and generalizations
- A new truncation strategy for the higher-order singular value decomposition
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Blind Multilinear Identification
- Canonical polyadic decomposition with a columnwise orthonormal factor matrix
- Computing the Polar Decomposition—with Applications
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Independent component analysis, a new concept?
- Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
- Most tensor problems are NP-hard
- Numerical computation for orthogonal low-rank approximation of tensors
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Orthogonal low rank tensor approximation: alternating least squares method and its global convergence
- Orthogonal tensor decompositions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
- Semialgebraic geometry of nonnegative tensor rank
- Shifted power method for computing tensor eigenpairs
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(20)- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor
- On approximation algorithm for orthogonal low-rank tensor approximation
- Rank properties and computational methods for orthogonal tensor decompositions
- On global convergence of alternating least squares for tensor approximation
- Local convergence of the alternating least squares algorithm for canonical tensor approximation
- On the global convergence of the alternating least squares method for rank-one approximation to generic tensors
- Orthogonal low rank tensor approximation: alternating least squares method and its global convergence
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Tensor completion via total curvature variation and low-rank matrix factorization
- The R-linear convergence of IPPDA for symmetric low rank orthogonal tensor approximation
- A sparse optimization approach for simultaneous orthogonal tensor diagonalization
- A modified spectral projected gradient method for tensor approximations over closed convex sets
- Polar decomposition-based algorithms on the product of Stiefel manifolds with applications in tensor approximation
- Low rank tensor decompositions and approximations
- _1-norm simultaneous approximate diagonalization and a proximal alternating maximization method
- Group sparse-based tensor CP decomposition: model, algorithm, and applications in chemometrics
- Discriminative tensor ring completion: a Laplace-based nonconvex surrogate for rank minimization
This page was built for publication: The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146632)
