Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
From MaRDI portal
Publication:6038672
DOI10.1007/s10107-022-01867-8zbMath1518.65045arXiv1912.04085OpenAlexW2992571265WikidataQ114211647 ScholiaQ114211647MaRDI QIDQ6038672
Publication date: 2 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.04085
global convergencesublinear convergence\(R\)-linear convergenceorthogonally decomposable tensorslow rank orthogonal tensor approximation
Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ Black Box Approximation in the Tensor Train Format Initialized by ANOVA Decomposition ⋮ Nondegeneracy of eigenvectors and singular vector tuples of tensors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- On gradients of functions definable in o-minimal structures
- Independent component analysis, a new concept?
- Introductory lectures on convex optimization. A basic course.
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Orthogonal and unitary tensor decomposition from an algebraic perspective
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Musings on multilinear fitting
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- First-order methods almost always avoid strict saddle points
- Orthogonal Tensor Decompositions
- Rank-One Approximation to High Order Tensors
- Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
- A literature survey of low-rank tensor approximation techniques
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- Tensor decompositions for learning latent variable models
- On the Global Convergence of the Alternating Least Squares Method for Rank-One Approximation to Generic Tensors
- A new convergence proof for the higher-order power method and generalizations
- Tensor Spaces and Numerical Tensor Calculus
- Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Orthogonal Low Rank Tensor Approximation: Alternating Least Squares Method and Its Global Convergence
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors
- Matrix Analysis
- Computing the Polar Decomposition—with Applications
- LAPACK Users' Guide
- Morse Theory. (AM-51)
- The Geometry of Algorithms with Orthogonality Constraints
- Variational Analysis
- A Counterexample to the Possibility of an Extension of the Eckart--Young Low-Rank Approximation Theorem for the Orthogonal Rank Tensor Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- First-Order Methods in Optimization
- Canonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix
- Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms
- The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence
- Numerical Computation for Orthogonal Low-Rank Approximation of Tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Tensor Analysis
- Majorization for Changes in Angles Between Subspaces, Ritz Values, and Graph Laplacian Spectra
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
