Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization

DOI10.1137/17M1116295zbMath1378.15016arXiv1702.03750OpenAlexW2592115330MaRDI QIDQ3130419

Konstantin Usevich, Pierre Comon, Jian Ze Li

Publication date: 22 January 2018

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.03750

zbMATH Keywords

global convergenceproximal algorithmJacobi rotationŁojasiewicz gradient inequalityorthogonal tensor diagonalization

Mathematics Subject Classification ID

Related Items (15)

Robust Eigenvectors of Symmetric Tensors ⋮ On approximation algorithm for orthogonal low-rank tensor approximation ⋮ 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 ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices ⋮ Randomized Joint Diagonalization of Symmetric Matrices ⋮ Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications ⋮ Trace maximization algorithm for the approximate tensor diagonalization ⋮ 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 ⋮ On approximate diagonalization of third order symmetric tensors by orthogonal transformations ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Independent component analysis, a new concept?
• Orthogonal Tensor Decompositions
• Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
• 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
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
• Symmetric Tensors and Symmetric Tensor Rank
• Structure-Preserving Low Multilinear Rank Approximation of Antisymmetric Tensors
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions

This page was built for publication: Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization