Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658)
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: Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy |
scientific article; zbMATH DE number 7170030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy |
scientific article; zbMATH DE number 7170030 |
Statements
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (English)
0 references
20 February 2020
0 references
polynomial optimization
0 references
sparse sum-of-squares hierarchy
0 references
semi-definite programming
0 references
pooling problem
0 references
chordal sparsity structure
0 references
discrete-time optimal control
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.89066481590271
0 references
0.8464962840080261
0 references
0.8223886489868164
0 references
0.8154098987579346
0 references
