Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Gue Myung Lee / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C22 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6584554 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
global continuous optimization | |||
| Property / zbMATH Keywords: global continuous optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparse polynomial optimization | |||
| Property / zbMATH Keywords: sparse polynomial optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
structured sparsity | |||
| Property / zbMATH Keywords: structured sparsity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sums of squares polynomials | |||
| Property / zbMATH Keywords: sums of squares polynomials / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
semidefinite programming relaxations | |||
| Property / zbMATH Keywords: semidefinite programming relaxations / rank | |||
Normal rank | |||
Revision as of 19:09, 27 June 2023
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
