Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations

10/05/2021
by   Zhou Sheng, et al.
0

In this paper, we mainly study the gradient based Jacobi-type algorithms to maximize two classes of homogeneous polynomials with orthogonality constraints, and establish their convergence properties. For the first class of homogeneous polynomials subject to a constraint on a Stiefel manifold, we reformulate it as an optimization problem on a unitary group, which makes it possible to apply the gradient based Jacobi-type (Jacobi-G) algorithm. Then, if the subproblem can be always represented as a quadratic form, we establish the global convergence of Jacobi-G under any one of the three conditions (A1), (A2) and (A3). The convergence result for (A1) is an easy extension of the result in [Usevich et al. SIOPT 2020], while (A2) and (A3) are two new ones. This algorithm and the convergence properties apply to the well-known joint approximate symmetric tensor diagonalization and joint approximate symmetric trace maximization. For the second class of homogeneous polynomials subject to constraints on the product of Stiefel manifolds, we similarly reformulate it as an optimization problem on the product of unitary groups, and then develop a new gradient based multi-block Jacobi-type (Jacobi-MG) algorithm to solve it. We similarly establish the global convergence of Jacobi-MG under any one of the three conditions (A1), (A2) and (A3), if the subproblem can be always represented as a quadratic form. This algorithm and the convergence properties apply to the well-known joint approximate tensor diagonalization and joint approximate tensor compression. As the proximal variants of Jacobi-G and Jacobi-MG, we also propose the Jacobi-GP and Jacobi-MGP algorithms, and establish their global convergence without any further condition. Some numerical results are provided indicating the efficiency of the proposed algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2020

Gradient based block coordinate descent algorithms for joint approximate diagonalization of matrices

In this paper, we propose a gradient based block coordinate descent (BCD...
research
12/22/2019

Polar decomposition based algorithms on the product of Stiefel manifolds with applications in tensor approximation

In this paper, based on the matrix polar decomposition, we propose a gen...
research
06/27/2022

A homogeneous Rayleigh quotient with applications in gradient methods

Given an approximate eigenvector, its (standard) Rayleigh quotient and h...
research
11/02/2019

Jacobi-type algorithm for low rank orthogonal approximation of symmetric tensors and its convergence analysis

In this paper, we propose a Jacobi-type algorithm to solve the low rank ...
research
11/02/2021

Trace maximization algorithm for the approximate tensor diagonalization

In this paper we develop a Jacobi-type algorithm for the (approximate) d...
research
12/16/2019

On the convergence of Jacobi-type algorithms for Independent Component Analysis

Jacobi-type algorithms for simultaneous approximate diagonalization of s...

Please sign up or login with your details

Forgot password? Click here to reset