Spectral factorizations and sums of squares representations via semidefinite programming (Q2784372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Spectral factorizations and sums of squares representations via semidefinite programming |
scientific article; zbMATH DE number 1732264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spectral factorizations and sums of squares representations via semidefinite programming |
scientific article; zbMATH DE number 1732264 |
Statements
23 April 2002
0 references
spectral factorization
0 references
inner-outer factorization
0 references
sums of squares
0 references
multivariable trigonometric polynomial
0 references
truncated moment problem
0 references
semidefinite programming
0 references
algorithm
0 references
Spectral factorizations and sums of squares representations via semidefinite programming (English)
0 references
The authors consider multivariate trigonofetric polynomials which can be written as a sum of squares, together with the truncated moment problem. Also considered is an algorithm for finding a sum of squares representation. Conditions for the existence of a spectral factorization are addressed and there is a discussion of inner-outer factorizations. A treatment is given of the dual of the factorization problem. Much of the analysis depends on the references (over 40).
0 references
