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