Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635)
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: Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations |
scientific article |
Statements
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (English)
0 references
1 April 2014
0 references
polynomial optimization
0 references
bivalent constraints
0 references
box constraints
0 references
global optimality conditions
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91475475
0 references
0.9005971
0 references
0.89835733
0 references
0.89469343
0 references
0 references
0.88944703
0 references
0.8859773
0 references
