The Dynamics of Swamps in the Canonical Tensor Approximation Problem
From MaRDI portal
Publication:5238232
DOI10.1137/18M1181389zbMath1435.65032OpenAlexW2964234951WikidataQ120904224 ScholiaQ120904224MaRDI QIDQ5238232
Publication date: 28 October 2019
Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1181389
Numerical optimization and variational techniques (65K10) Algorithms for approximation of functions (65D15) Multilinear algebra, tensor calculus (15A69) Dynamical systems in numerical analysis (37N30)
Related Items (1)
Uses Software
Cites Work
- On the non-existence of optimal solutions and the occurrence of ``degeneracy in the CANDECOMP/PARAFAC model
- On the third secant variety
- Efficient convolution with the Newton potential in \(d\) dimensions
- A comparison of algorithms for fitting the PARAFAC model
- Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
- Finding the limit of diverging components in three-way Candecomp/Parafac -- a demonstration of its practical merits
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- Musings on multilinear fitting
- Variational calculus with sums of elementary tensors of fixed rank
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher
- Degeneracy in Candecomp/Parafac and Indscal explained for several three-sliced arrays with a two-valued typical rank
- Trigonometric identities and sums of separable functions
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- A Three-Way Jordan Canonical Form as Limit of Low-Rank Tensor Approximations
- A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
- Candecomp/Parafac: From Diverging Components to a Decomposition in Block Terms
- Structure of the Hessian matrix and an economical implementation of Newton’s method in the problem of canonical approximation of tensors
- A Decomposition for Three-Way Arrays
- The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor
- A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximation
- A Method to Avoid Diverging Components in the Candecomp/Parafac Model for Generic $I\timesJ\times2$ Arrays
- Numerical operator calculus in higher dimensions
- The Condition Number of Join Decompositions
- An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Low-Rank Approximation of Generic $p \timesq \times2$ Arrays and Diverging Components in the Candecomp/Parafac Model
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Algorithms for Numerical Analysis in High Dimensions
- Unitary Triangularization of a Nonsymmetric Matrix
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- Exact line and plane search for tensor optimization
This page was built for publication: The Dynamics of Swamps in the Canonical Tensor Approximation Problem
