Constrained Polynomial Optimization Problems with Noncommuting Variables

DOI10.1137/110830733zbMath1263.90052OpenAlexW2033316317MaRDI QIDQ2910876

Janez Povh, Igor Klep, Kristijan Cafuta

Publication date: 12 September 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110830733

zbMATH Keywords

noncommutative algebrapolynomial optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10)

Related Items (8)

Noncommutative Christoffel-Darboux kernels ⋮ Sparse noncommutative polynomial optimization ⋮ Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Optimization over trace polynomials

Uses Software

• SparsePOP
• GloptiPoly
• NCAlgebra

This page was built for publication: Constrained Polynomial Optimization Problems with Noncommuting Variables