Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials

DOI10.1007/s10589-012-9513-8zbMath1273.90144MaRDI QIDQ354616

Kristijan Cafuta, Igor Klep, Sabine Burgdorf, Janez Povh

Publication date: 19 July 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9513-8

zbMATH Keywords

Newton polytope; semidefinite programming; free positivity; noncommutative polynomial; sum of squares; matlab toolbox

Mathematics Subject Classification ID

90C22: Semidefinite programming

Related Items

Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools

Uses Software

• Matlab
• Benchmarks for Optimization Software
• NCSOStools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Benchmarks for Optimization Software
• Proof of the BMV conjecture
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
• Noncommutative sums of squares
• Sums of Hermitian squares and the BMV conjecture
• Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
• Extremal psd forms with few terms
• An independent benchmarking of SDP and SOCP solvers
• Semidefinite programming relaxations for semialgebraic problems
• ``Positive noncommutative polynomials are sums of squares.
• The tracial moment problem and trace-optimization of polynomials
• Computing sum of squares decompositions with rational coefficients
• Connes' embedding conjecture and sums of Hermitian squares
• Global Optimization with Polynomials and the Problem of Moments
• Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics
• Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
• Semidefinite optimization
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• On the Convergence of the Central Path in Semidefinite Optimization
• Semidefinite Programming
• Regularization Methods for Semidefinite Programming
• Optimization of Polynomials on Compact Semialgebraic Sets
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Factorization of operator-valued polynomials in several non-commuting variables