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

DOI10.1016/j.jmaa.2010.03.045zbMath1205.90215arXiv0906.2214OpenAlexW2026051325MaRDI QIDQ984697

Jakob Cimprič

Publication date: 20 July 2010

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

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

zbMATH Keywords

global optimizationsemidefinite programmingdifferential operatorsnoncommutative real algebraic geometry

Mathematics Subject Classification ID

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

Related Items (9)

Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ A paradox in bosonic energy computations via semidefinite programming relaxations ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Invariant Semidefinite Programs ⋮ SDP Relaxations for Non-Commutative Polynomial Optimization ⋮ Algorithm 950 ⋮ On 𝑞-normal operators and the quantum complex plane

Uses Software

• Sostools
• SeDuMi
• SDPT3
• GloptiPoly
• YALMIP

Cites Work

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

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