Optimization of polynomials in non-commuting variables
DOI10.1007/978-3-319-33338-0zbMATH Open1388.90001OpenAlexW2476213965MaRDI QIDQ2803374FDOQ2803374
Authors: 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
Recommendations
- Constrained polynomial optimization problems with noncommuting variables
- The tracial moment problem and trace-optimization of polynomials
- Sparse noncommutative polynomial optimization
- Convex and positive noncommutative polynomials
- Constrained trace-optimization of polynomials in freely noncommuting variables
Symbolic computation and algebraic computation (68W30) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational aspects of associative rings (general theory) (16Z05) Semialgebraic sets and related spaces (14P10) Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10)
Cited In (39)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- The tracial moment problem on quadratic varieties
- Extreme points of matrix convex sets, free spectrahedra, and dilation theory
- Further techniques on a polynomial positivity question of Collins, Dykema, and Torres-Ayala
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Minimizer Extraction in Polynomial Optimization Is Robust
- Efficient Evaluation of Noncommutative Polynomials Using Tensor and Noncommutative Waring Decompositions
- Bilinear matrix inequalities and polynomials in several freely noncommuting variables
- Exploiting constant trace property in large-scale polynomial optimization
- Optimization over trace polynomials
- The moment-SOS hierarchy: applications and related topics
- Empirical Properties of Optima in Free Semidefinite Programs
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- The singular bivariate quartic tracial moment problem
- Simplification of symbolic polynomials on non-commutative variables
- Noncommutative polynomials describing convex sets
- Compact sets in the free topology
- Positive maps and trace polynomials from the symmetric group
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Bianalytic maps between free spectrahedra
- Noncommutative nullstellensätze and perfect games
- Optimizing a linear function over a noncompact real algebraic variety
- A Characterization of Perfect Strategies for Mirror Games
- Convex and positive noncommutative polynomials
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- Sparse noncommutative polynomial optimization
- A new approximation hierarchy for polynomial conic optimization
- Exploiting term sparsity in noncommutative polynomial optimization
- Matrix extreme points and free extreme points of free spectrahedra
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- The constant trace property in noncommutative optimization
- Free extreme points span generalized free spectrahedra given by compact coefficients
- Constrained polynomial optimization problems with noncommuting variables
- Noncommutative Christoffel-Darboux kernels
- Hilbert’s 17th problem in free skew fields
- Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
Uses Software
This page was built for publication: Optimization of polynomials in non-commuting variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803374)
