Optimization of Polynomials in Non-Commuting Variables

DOI10.1007/978-3-319-33338-0zbMath1388.90001OpenAlexW2476213965MaRDI QIDQ2803374

Sabine Burgdorf, Igor Klep, Janez Povh

Publication date: 4 May 2016

Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33338-0

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Semialgebraic sets and related spaces (14P10) Computational aspects of associative rings (general theory) (16Z05)

Related Items (24)

Noncommutative Christoffel-Darboux kernels ⋮ Sparse noncommutative polynomial optimization ⋮ Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization ⋮ Extreme points of matrix convex sets, free spectrahedra, and dilation theory ⋮ Minimizer Extraction in Polynomial Optimization Is Robust ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ Empirical Properties of Optima in Free Semidefinite Programs ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ A Characterization of Perfect Strategies for Mirror Games ⋮ Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem ⋮ Bilinear matrix inequalities and polynomials in several freely noncommuting variables ⋮ Noncommutative nullstellensätze and perfect games ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ Hilbert’s 17th problem in free skew fields ⋮ Bianalytic maps between free spectrahedra ⋮ The singular bivariate quartic tracial moment problem ⋮ The tracial moment problem on quadratic varieties ⋮ Noncommutative polynomials describing convex sets ⋮ Compact sets in the free topology ⋮ Optimization over trace polynomials ⋮ Efficient Evaluation of Noncommutative Polynomials Using Tensor and Noncommutative Waring Decompositions ⋮ In SDP Relaxations, Inaccurate Solvers Do Robust Optimization ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ Positive maps and trace polynomials from the symmetric group

Uses Software

• Mathematica
• Matlab
• NCSOStools
• NCAlgebra

This page was built for publication: Optimization of Polynomials in Non-Commuting Variables