Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290)
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: Semidefinite program duals for separable polynomial programs involving box constraints |
scientific article; zbMATH DE number 7187335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semidefinite program duals for separable polynomial programs involving box constraints |
scientific article; zbMATH DE number 7187335 |
Statements
Semidefinite program duals for separable polynomial programs involving box constraints (English)
0 references
7 April 2020
0 references
A dual problem to a separable polynomial optimization problem with box constraints is proposed, by means of sums of squares univariate polynomials, and it is shown that it can be reformulated as a semidefinite programming problem. A corresponding strong duality statement is provided under convexification and Slater-type qualification conditions. Illustrating examples are given, too.
0 references
polynomial program
0 references
semidefinite linear program
0 references
dual problem
0 references
Slater's condition
0 references
box constraint
0 references
0 references
0 references
0 references
0 references
0 references
0.7946290373802185
0 references
0.7940879464149475
0 references
0.7784217000007629
0 references
0.7731635570526123
0 references
