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

DOI10.1016/J.JMAA.2010.03.045zbMATH Open1205.90215arXiv0906.2214OpenAlexW2026051325MaRDI QIDQ984697FDOQ984697

Authors: Jakob Cimprič 

Publication date: 20 July 2010

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

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 $YX-XY=1$ and $X^{a}st=X$, $Y^{a}st=-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.

Full work available at URL: https://arxiv.org/abs/0906.2214

Recommendations

• Sparse noncommutative polynomial optimization
• SDP relaxations for non-commutative polynomial optimization
• Constrained polynomial optimization problems with noncommuting variables
• scientific article; zbMATH DE number 1984325
• Convergent relaxations of polynomial optimization problems with noncommuting variables

zbMATH Keywords

global optimizationsemidefinite programmingdifferential operatorsnoncommutative real algebraic geometry

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Noncommutative algebraic geometry (14A22)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Solving semidefinite-quadratic-linear programs using SDPT3
• Global optimization with polynomials and the problem of moments
• GloptiPoly
• Semidefinite programming relaxations for semialgebraic problems
• Symmetry groups, semidefinite programs, and sums of squares
• Uniform denominators in Hilbert's seventeenth problem
• Sums of squares, moment matrices and optimization over polynomials
• A strict Positivstellensatz for the Weyl algebra
• The Friedrichs extension of singular differential operators
• SOSTOOLS and Its Control Applications
• ``Positive noncommutative polynomials are sums of squares.
• Positive polynomials and sums of squares
• Convergent relaxations of polynomial optimization problems with noncommuting variables
• Non-commutative Real Algebraic Geometry - Some Basic Concepts and First Ideas
• Extremal psd forms with few terms
• Computing sum of squares decompositions with rational coefficients
• Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
• A strict Positivstellensatz for enveloping algebras
• Algebras of fractions and strict Positivstellensätze for \(*\)-algebras
• On the positivstellensatz in Weyl’s algebra
• Operator-theoretic Positivstellensätze
• Generation of invariants
• The truncated tracial moment problem
• Title not available (Why is that?)
• Unbounded induced representations of \(\ast \)-algebras
• Positive elements in the algebra of the quantum moment problem
• Role of redundant constraints for improving dual bounds in polynomial optimization problems
• Precise numerical solutions of potential problems using the Crank-Nicolson method
• Bounds on Schrödinger eigenvalues for polynomial potentials in N dimensions

Cited In (12)

• The tracial moment problem and trace-optimization of polynomials
• Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
• Optimizations of free polynomials
• Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
• Polynomial optimization and a Jacobi-Davidson type method for commuting matrices
• Minimizer Extraction in Polynomial Optimization Is Robust
• Minimizing trigonometric matrix polynomials over semi-algebraic sets
• Constrained trace-optimization of polynomials in freely noncommuting variables
• On \(q\)-normal operators and the quantum complex plane
• SDP relaxations for non-commutative polynomial optimization
• Invariant Semidefinite Programs
• A paradox in bosonic energy computations via semidefinite programming relaxations

Uses Software

• Sostools
• SeDuMi
• SDPT3
• GloptiPoly
• YALMIP

This page was built for publication: A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984697)