Abstract
A method for computing global minima of real multivariate polynomials based on semidefinite programming was developed by N.Z. Shor, J.B. Lasserre and P.A. Parrilo. The aim of this article is to extend a variant of their method to noncommutative symmetric polynomials in variables X and Y satisfying Y X − X Y = 1 and X * = X , Y * = − Y . Global minima of such polynomials are defined and showed to be equal to minima of the spectra of the corresponding differential operators. We also discuss how to exploit sparsity and symmetry. Several numerical experiments are included. The last section explains how our theory fits into the framework of noncommutative real algebraic geometry.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
