Constrained polynomial optimization problems with noncommuting variables (Q2910876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6081228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constrained polynomial optimization problems with noncommuting variables |
scientific article; zbMATH DE number 6081228 |
Statements
12 September 2012
0 references
polynomial optimization
0 references
noncommutative algebra
0 references
0.9496547
0 references
0.94416153
0 references
0.9331444
0 references
0.9253872
0 references
0.90700996
0 references
0.9036609
0 references
0 references
0.9009633
0 references
0.8984341
0 references
Constrained polynomial optimization problems with noncommuting variables (English)
0 references
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.
0 references
