Optimization of Polynomials in Non-Commuting Variables

DOI10.1007/978-3-319-33338-0zbMath1388.90001MaRDI 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

68W30: Symbolic computation and algebraic computation

90C22: Semidefinite programming

90C26: Nonconvex programming, global optimization

16S10: Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.)

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

14P10: Semialgebraic sets and related spaces

16Z05: Computational aspects of associative rings (general theory)

Related Items

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

Uses Software