Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
Numerical Analysis
2017-07-28 v2 Information Theory
math.IT
Optimization and Control
Abstract
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.
Cite
@article{arxiv.1702.03750,
title = {Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization},
author = {Jianze Li and Konstantin Usevich and Pierre Comon},
journal= {arXiv preprint arXiv:1702.03750},
year = {2017}
}
Comments
22 pages, 6 figures