Polynomial optimization and a Jacobi–Davidson type method for commuting matrices

Abstract

In this paper we introduce an new Jacobi-Davidson type eigenvalue solver for a set of commuting matrices, called JD-COMM, used for the global optimization of so-called Minkowski-norm dominated polynomials in several variables. The Stetter-Möller matrix method yields such a set of real non-symmetric commuting matrices since it reformulates the optimization problem as an eigenvalue problem. A drawback of this approach is that the matrix most relevant for computing the global optimum of the polynomial under investigation is usually large and only moderately sparse. However, the other matrices are generally much sparser and have the same eigenvectors because of the commutativity. This fact is used to design the JDCOMM method for this problem: the most relevant matrix is used only in the outer loop and the sparser matrices are exploited in the solution of the correction equation in the inner loop to greatly improve the efficiency of the method. Some numerical examples demonstrate that the method proposed in this paper is more efficient than approaches that work on the main matrix (standard Jacobi-Davidson and implicitly restarted Arnoldi), as well as conventional solvers for computing the global optimum, i.e., SOSTOOLS, GloptiPoly, and PHCpack.

Algebraic polynomial system solving and applications

“…Consider a Minkowski dominated polynomial in 5 variables (n = 5), a total degree of 6 (d = 3, m = 5), and λ = 1: 7. 14 shows the sparsity of all the involved matrices.…”

“…It turns out that in some cases the approach described here has a superior performance in terms of time and accuracy over other more conventional methods. Preliminary and partial results described in Part II of this thesis have been communicated in [13], [14], [15], [16], [17], [18], [20], [53], and [88].…”