Constrained polynomial optimization problems with noncommuting variables
Motivated by applications in control theory and systems engineering, the authors extend existing results on unconstrained polynomial optimization with noncommutating variables to the case of polydisc and ball constraints. They show that a noncommutative (nc) polynomial is nonnegative on these sets if and only if it is a sum of squares. As a consequence of this property, when solving nc polynomial optimization problems, there is need to construct a whole hierarchy of semidefinite programming (SDP) problems, optima can be obtained via a single SDP problem. This is in sharp contrast with the commutative case.
- Optimization of polynomials in non-commuting variables
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Nondifferentiable optimization and polynomial problems
- Optimization Problems over Non-negative Polynomials with Interpolation Constraints
- Polynomial optimization problems and their relaxations
- Polynomial optimization problems
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- SDP relaxations for non-commutative polynomial optimization
- Polynomial vector variational inequalities under polynomial constraints and applications
- The tracial moment problem and trace-optimization of polynomials
- Optimization over trace polynomials
- Sparse noncommutative polynomial optimization
- Exploiting term sparsity in noncommutative polynomial optimization
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Polynomial optimization and a Jacobi-Davidson type method for commuting matrices
- SDP relaxations for non-commutative polynomial optimization
- Optimization of polynomials in non-commuting variables
- Polynomial vector variational inequalities under polynomial constraints and applications
- Optimizations of free polynomials
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Convex and positive noncommutative polynomials
- The convex Positivstellensatz in a free algebra
- Simplification of symbolic polynomials on non-commutative variables
- Minimizer Extraction in Polynomial Optimization Is Robust
- Optimization Problems over Non-negative Polynomials with Interpolation Constraints
- Noncommutative Christoffel-Darboux kernels
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization
- Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming
This page was built for publication: Constrained polynomial optimization problems with noncommuting variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910876)
