A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697)

A method for computing global infima of real multivariate polynomials based on semidefinite programming was developed by \textit{N.\,Z.\thinspace Shor} [Nondifferentiable optimization and polynomial problems, Nonconvex Optimization and Its Applications 24, Dordrecht, Kluwer (1998; Zbl 0901.49015)] , \textit{J.\,B.\thinspace Lasserre} [SIAM J.~Optim.\ 11, No.\,3, 796--817 (2001; Zbl 1010.90061)] and \textit{P.\,A.\thinspace Parrilo} [Math.\ Program.\ 96 B, 293--320 (2003; Zbl 1043.14018)]. The present article aims to extend a variant of their method to noncommutative symmetric polynomials. In Section~2, the author extends it from polynomials to polynomial differential operators. Later sections are concerned with improvements of the basic method and numerical experiments.