Optimization of polynomials in non-commuting variables
From MaRDI portal
Publication:2803374
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)
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
Cited in
(41)- Efficient evaluation of noncommutative polynomials using tensor and noncommutative Waring decompositions
- Free extreme points span generalized free spectrahedra given by compact coefficients
- A new approximation hierarchy for polynomial conic optimization
- Optimizations of free polynomials
- Bilinear matrix inequalities and polynomials in several freely noncommuting variables
- Optimization over trace polynomials
- Exploiting term sparsity in noncommutative polynomial optimization
- Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Optimizing a linear function over a noncompact real algebraic variety
- Noncommutative polynomials describing convex sets
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
- Minimizer Extraction in Polynomial Optimization Is Robust
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- Compact sets in the free topology
- Bianalytic maps between free spectrahedra
- Sparse noncommutative polynomial optimization
- Constrained polynomial optimization problems with noncommuting variables
- Simplification of symbolic polynomials on non-commutative variables
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Extreme points of matrix convex sets, free spectrahedra, and dilation theory
- Positive maps and trace polynomials from the symmetric group
- Exploiting constant trace property in large-scale polynomial optimization
- The singular bivariate quartic tracial moment problem
- 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
- The moment-SOS hierarchy: applications and related topics
- Noncommutative nullstellensätze and perfect games
- Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
- Further techniques on a polynomial positivity question of Collins, Dykema, and Torres-Ayala
- Noncommutative Christoffel-Darboux kernels
- A Characterization of Perfect Strategies for Mirror Games
- Hilbert's 17th problem in free skew fields
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Convex and positive noncommutative polynomials
- SDP relaxations for non-commutative polynomial optimization
- Matrix extreme points and free extreme points of free spectrahedra
- Empirical Properties of Optima in Free Semidefinite Programs
- The constant trace property in noncommutative optimization
- The tracial moment problem on quadratic varieties
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)
