Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220)
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 6584554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets |
scientific article; zbMATH DE number 6584554 |
Statements
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (English)
0 references
25 May 2016
0 references
global continuous optimization
0 references
sparse polynomial optimization
0 references
structured sparsity
0 references
sums of squares polynomials
0 references
semidefinite programming relaxations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.882128119468689
0 references
0.877602219581604
0 references
0.8764162063598633
0 references
0.8385426998138428
0 references
