# Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization

arXiv: https://arxiv.org/abs/1702.03750 · HTML: https://mlsanity.com/paper/1702.03750/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Feb 2017.

## Built on by (most cited first, 1 of 1)

- [Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition](https://mlsanity.com/paper/2204.07208/) (2022)

## Abstract (arXiv)

In this paper, we consider a family of Jacobi-type algorithms for simultaneous orthogonal diagonalization problem of symmetric tensors. For the Jacobi-based algorithm of [SIAM J. Matrix Anal. Appl., 2(34):651--672, 2013], we prove its global convergence for simultaneous orthogonal diagonalization of symmetric matrices and 3rd-order tensors. We also propose a new Jacobi-based algorithm in the general setting and prove its global convergence for sufficiently smooth functions.