On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569)
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: On duality gap with polynomial multipliers for polynomial optimization problems |
scientific article; zbMATH DE number 7658514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On duality gap with polynomial multipliers for polynomial optimization problems |
scientific article; zbMATH DE number 7658514 |
Statements
On duality gap with polynomial multipliers for polynomial optimization problems (English)
0 references
2 March 2023
0 references
non-convex polynomial program
0 references
SOS-convexity
0 references
semidefinite programming relaxation
0 references
sum of squares certificate
0 references
convergent relaxation
0 references
0 references
0 references
0 references
0 references
0.8600690364837646
0 references
0.83162921667099
0 references
0.7990396022796631
0 references
0.7706149220466614
0 references
