Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10898-015-0356-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10898-015-0356-6 / rank | |||
Normal rank | |||
Revision as of 15:45, 8 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets |
scientific article |
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
